CN1851642A - Interface data grammar analytic processing system and its analytic processing method - Google Patents
Interface data grammar analytic processing system and its analytic processing method Download PDFInfo
- Publication number
- CN1851642A CN1851642A CN 200510102452 CN200510102452A CN1851642A CN 1851642 A CN1851642 A CN 1851642A CN 200510102452 CN200510102452 CN 200510102452 CN 200510102452 A CN200510102452 A CN 200510102452A CN 1851642 A CN1851642 A CN 1851642A
- Authority
- CN
- China
- Prior art keywords
- grammar
- data
- processing
- analyzing
- semantic primitive
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Landscapes
- Devices For Executing Special Programs (AREA)
- Machine Translation (AREA)
Abstract
The present invention includes communication device, grammatical analysis processing unit, analytical treatment controller and output device. Said Analytical treatment controller loads received interface data to corresponded one or several analytical treatment sub-device of grammatical analysis processing unit according to equipment marking; analytical treatment device converting interface data grammar into semantic unit and separator separated grammar language or length formed semantic unit grammar language, to obtain semantic unit and separator assembly, outputting semantic unit information; analytical treatment controller sending analytical treated outputted unit information to output device; output device grammatical analysis processing unit processed semantic unit information to data application processing system. The present invention does not need hard code, effectively reduces interface development and maintenance work.
Description
Technical field
The invention belongs to computer software technical field, specifically a kind of interface data grammar analysis process system and analysis and processing method thereof, by the data syntax treating apparatus data syntax of software systems collection are carried out analyzing and processing, extract effective information, do not need hard coded, by graphical interfaces or configuration file data syntax analysis processing unit is configured the analyzing and processing of finishing interface data grammar, has reduced the exploitation and the maintenance workload of interface effectively.
Technical background
Software systems generally all need to dock with different external systems by interface.The mode that achieves a butt joint generally can be divided into the data that data acquisition and two parts of data processing are handled external system.Data acquisition realizes the accurate data transmission, and the data acquisition that external system is provided is to software systems, and generally by the agreement of standard, maturation, also the agreement of available customization is carried out data acquisition.The data that data processing is primarily aimed at after the collection are carried out processing real-time or timing, the needs of effective information in the interface of external system according to native system are extracted, and the process of this processing is exactly the process that the syntax of docking port data language are handled.Externally under the systematic comparison situation how, it is very complicated that this processing can become.
With the Integrated Network Management System is example, and Integrated Network Management System need dock with the plurality of devices of different specialties, different vendor, different editions.The quantity of these system interfaces is very huge, with telecommunications is example, specialties such as transmission, exchange, power, data are arranged, each specialty has several even dozens of equipment supplier, each equipment supplier has multiple different type of machines, each type has a plurality of different versions again, even each version all has several different interface languages.Even it is the processing of each above-mentioned interface language is all very simple, that they are comprehensive to also being a complicated system engineering together.
If from formal branch, then interface language can be divided into following two kinds: a kind of is the text interface language, is also referred to as the man-machine interface language, and a kind of is the Binary Interface language.The Binary Interface language is the byte stream of computer interface.The Binary Interface language is the scale-of-two syntax.The text interface language generally is divided into 4 classes according to the form of the syntax: 0 type: the unconfined phrase syntax.Proved separating not have and separated except that some special 0-type grammar has; 1 type: context-dependent grammar.Separate, the complexity of Processing Algorithm is very high, and time complexity all is exponential, and general interface definition does not adopt type 1 grammar basically; 2 types: context-free grammar.Separate, the disposal route maturation, have many instruments can with as the compiler YACC (Yet AnotherCompiler Compiler) of compiler, U.S. Sun Company Inc. based on the compiler JavaCC (JavaCompiler Compiler) of the compiler of Java language etc.; 3 types: canonical grammar.Can be exchanged into type 2 grammar.
In the prior art, the analysis and processing method of text interface data grammar has two kinds basically, and a kind of is that each interface data is carried out keyword scan, extracts effective information; Another kind is at 2 types and type 3 grammar, utilizes hard coded or hard coded Core Generator such as YACC, JavaCC etc. to finish syntax analysis and handles, and extracts the effective information of interface data then.Though the keyword scan efficient of text handling method is higher, and is not too reliable.Some interface keyword is difficult to determine in addition.It is reliable to carry out strict syntax processing, but can only be at type 2 grammar and type 3 grammar, and for type 1 grammar, treatment effeciency is too low, and is unavailable basically, and 0-type grammar can't be handled substantially; Because be hard coded or comparatively difficult by the hard coded maintenance of instrument generation, the cost of exploitation new interface is also than higher; Owing to just can obtain effective information after must finishing whole processing, influence data processing efficiency.
The disposal route of the Binary Interface data syntax also has two kinds basically, and a kind of is that the internal memory hard copy is handled, and another kind is structure of definition, and the forced type conversion process is extracted effective information.The internal memory hard copy is safest method, but needs hard coded, can not be general, and must be that every kind of interface is realized a kind of hard copy code.The forced type conversion process realizes simple, but needs to handle syllable sequence and byte-aligned problem, for the byte-aligned problem, because different compilers to the disposal route difference of byte-aligned mode, can cause code to transplant relatively difficulty.Equally, the forced type conversion also needs hard coded.
Summary of the invention
For overcoming the deficiency of prior art, the object of the present invention is to provide a kind of interface data grammar analysis process system and analysis and processing method thereof, by the data syntax processing unit interface data of gathering is handled, with exploitation and the maintenance workload that reduces interface effectively.
For finishing the foregoing invention purpose, the overall technological scheme that the present invention takes is: a kind of interface data grammar analysis process system comprises with lower device:
Communication device, its connection device and analyzing and processing control device are used for data that accepting device the reports rower of going forward side by side and show;
The syntax analysis treating apparatus, it connects the analyzing and processing control device, comprise that at least one data syntax analysis handles sub-device, be used for interface data grammar is converted into grammatical language that semantic primitive and separator be separated by or the grammatical language that is formed semantic primitive by length, to obtain the set of semantic primitive and separator, output semantic primitive information;
The analyzing and processing control device, its end connects communication device, one end junction grammar APU is used for according to the equipment sign interface data of receiving being sent into one or several corresponding syntax analysis and handles sub-device, and the semantic primitive information of exporting after the analyzing and processing is delivered to output unit;
Output unit, it connects the analyzing and processing control device, is used for the semantic primitive information after the data application processing system output syntax analysis treating apparatus docking port data syntax analysis of outside is handled.
It is separation, test, pattern, type, search, conditioned disjunction length APU that described syntax analysis is handled sub-device.
A kind of interface data grammar analysis and processing method may further comprise the steps:
Step 1, analyzing and processing control device indicate the sub-device of one or several analyzing and processing of the interface data of receiving being sent into corresponding syntax analysis treating apparatus according to equipment;
Step 2, APU are converted into interface data grammar grammatical language that semantic primitive and separator be separated by or form the grammatical language of semantic primitive by length, obtain the set of semantic primitive and separator, export semantic primitive information;
The semantic primitive information that step 3, analyzing and processing control device are exported after with analyzing and processing is delivered to output unit;
Step 4, the semantic primitive information of output unit after data application processing system output syntax analysis treating apparatus docking port data syntax analysis is handled.
Interface data in the described step 1 specifically comprise 0-type grammar data, type 1 grammar data, type 2 grammar data, type 3 grammar data and scale-of-two syntax data.
Described 0-type grammar processing method of data specifically is meant: the clear and definite character that does not carry semantic information such as space, tab, carriage return, line feed etc. are directly added the separator set and deposit in the storer; To there be the character of semantic information to deposit in the semantic primitive set of storer.
Described 2 types or type 3 grammar disposal route specifically comprise: interface data character production is converted into the element production and deposits in the storer; The character that user in the production need be exported joins in the semantic primitive set, and unwanted character joins in the separator set, and deposits storer in; Dummy terminator is removed in semantic primitive set and separator set respectively, and the result is stored in the storer.
The sub-device of analyzing and processing in the described step 2 is meant separating device, separates analyzing and processing and specifically may further comprise the steps:
Generate the separator sequence according to the position of the non-semantic character of interface data and the frequency of appearance, and deposit in the computer memory;
Call separation symbol sequence, the docking port data are cut apart;
Output semantic primitive information.
The sub-device of analyzing and processing in the described step 2 is meant types of devices, and it specifically is the predefined type of semantic primitive information conforms of instigating terminal output that type analysis is handled, and these types comprise arithmetic type, character string type, time type.
The sub-device of analyzing and processing in the described step 2 is meant mode device, and pattern analysis is handled and specifically be may further comprise the steps:
Semantic primitive in the docking port data is carried out pattern match;
Output semantic primitive information.
The sub-device of analyzing and processing in the described step 2 is meant proving installation, and test analysis is handled the semantic primitive character specifically be meant in the docking port data or the logical relation between the character string is carried out true and false judgement.
The sub-device of analyzing and processing in the described step 2 is meant searcher, and searching analysis is handled the semantic primitive character that specifically is meant in the key word docking port data of forming with character string and searched for, and Search Results is carried out true and false judgement.
The sub-device of analyzing and processing in the described step 2 is meant the condition device, and the relation that condition analysis is handled between the semantic primitive that specifically is meant in the docking port data is tested judgement, and according to the corresponding statement of the true and false execution of test result.
The sub-device of analyzing and processing in the described step 2 is meant the length device, and the length analyzing and processing specifically is meant the application heap that obtains the field that the length separator is separated in the interface data.
The present invention has outstanding feature and beneficial technical effects, handles sub-device with the syntax that realize in advance the syntax are handled layer by layer, and the processing of the syntax is become simple by complexity.On the basis of realizing certain general sub-device of processing, part that the user can participate in such as language of equal value transform, handle parts such as sub-device is selected, the separator sequence is determined can be independent, participated in handling by graphical interfaces or configuration file under the situation that does not need hard coded by the user.Compare all by computer implemented method, efficiency ratio is higher, and the insurmountable problem of some computing machine, and the participation by the people also can partly solve.Basically do not need hard coded because the syntax of interface are handled, can effectively reduce exploitation and maintenance workload.
Description of drawings
Fig. 1 is a formation picture of device of the present invention;
Fig. 2 is a main flow chart;
Fig. 3 is the interface data form synoptic diagram in the specific embodiment of the invention.
Embodiment
Below in conjunction with Figure of description the specific embodiment of the present invention is described.
See also Fig. 1, interface data grammar analysis process system of the present invention comprises: communication device, its connection device and analyzing and processing control device are used for data that accepting device the reports rower of going forward side by side and show.Communicator is responsible for connecting between equipment and software systems, issues the analyzing and processing control device after the data that equipment is reported are stamped label (tag).Label is to indicate which kind of data that sends from which equipment, and each data type that reports is distributed a label, writes a configuration module in configuration file, and configuration file is made up of all configuration modules.
The syntax analysis treating apparatus, it connects the analyzing and processing control device, comprise that at least one data syntax analysis handles sub-device, be used for interface data grammar is converted into grammatical language that semantic primitive and separator be separated by or the grammatical language that is formed semantic primitive by length, to obtain the set of semantic primitive and separator, output semantic primitive information.APU was fought each other, and the data of label are analyzed and the result is reported application processing system handles, and it receives different data, analyze generate later unified to using system's significative results, as the long shaping number in the configuration file.
The analyzing and processing control device, its end connects communication device, one end junction grammar APU, be used for indicating and the interface data of receiving is sent into corresponding syntax analysis handle sub-device, and will go up a sub-device analysis and handle back output semantic primitive information and deliver to output unit or send into next height device and carry out analyzing and processing according to equipment;
Output unit, it connects the analyzing and processing control device, is used for the semantic primitive information after data handling system output syntax analysis treating apparatus docking port data syntax analysis is handled.
When software systems started, the configuration file of the sub-device of analyzing and processing was read in the initialization of syntax analysis treating apparatus, charges to internal memory, and what configuration file write down is exactly every type of execution sequence of analyzing sub-device.The analyzing and processing control device finds corresponding execution sequence according to label (tag) after receiving processing data to be analyzed, it puts into the sub-device of next analyzing and processing with the output of a processing data to be analyzed and a last sub-device of analyzing and processing successively according to carrying out sequence, after sequence is finished output unit is issued in the output of each type of container.Output unit is submitted to upper system with output, the general whole software of output format system is unified, increases the configuration file that device just will be revised the sub-device of analyzing and processing like this, increases to carry out sequence, the interface section does not need hard coded, and upper layer software (applications) need not revised yet.
APU comprises separation, test, pattern, type, search, conditioned disjunction length APU.
The grammar G of interface data comprises 0 type, 1 type, 2 types, type 3 grammar and the binary data syntax arbitrarily, and the language that is generated by these syntax can be converted into one of following bilingual of equal value, and the language that is generated by grammar G is designated as L (G).
Language one is designated as CL
1(G):
L (G)={ w
1c
1w
2c
2W
N-1c
N-1w
n| w
1W
n∈ T
*, c
1C
N-1∈ T
*, T be the syntax alphabet
w
1c
1w
2c
2W
N-1c
N-1w
nBe the sentence pattern of language L (G), c
1C
N-1Be separator, the set of separator is designated as D, w
1W
nBe semantic primitive, the set of semantic primitive is designated as E.
Language two is designated as CL
2(G):
L (G)={ w
1w
2w
3W
m| Length (w
i)=n, i ∈ 1,2,3 ..., m}, n are the length values of determining of a grammar definition.
Equally, w
1W
nBe semantic primitive, but at CL
2(G) semantic primitive is not to separate with separator in, but separates according to its length, length can be interpreted as a kind of abstract separator.
What need to obtain in the processing of docking port data is semantic primitive information, and separator is only meaningful when the syntax are handled.As interface " temperature=20 ℃, it is actual that what be concerned about is temperature and 20 ℃, under specific circumstances, as having only a degree centigrade a kind of situation in the interface data definition, to " ℃ " this symbol is indifferent to, and also can treat as separator.From this example as can be seen, separator and semantic primitive are not absolute, and the effective information that need to obtain is exactly a semantic primitive, other all be separator.Semantic primitive itself is self-contained, and promptly each semantic primitive can be separated into littler semantic primitive, as long as there is suitable separator.
See also Fig. 2, main flow chart of the present invention.The text syntax language of interface data should be converted into CL
1(G), comprise 0 type, 1 type, 2 types, type 3 grammar, the Binary Interface language should be converted into CL
2(G).The present invention changes into CL with text language
1(G), binary language is converted into CL
2(G) step is as follows:
Step 1, analyzing and processing control device indicate the sub-device of analyzing and processing of the interface data of receiving being sent into corresponding syntax analysis treating apparatus according to equipment, and it is according to CL
1(G) or CL
2The feature selecting syntax analysis of the syntax that include the semantic primitive sequence of sets of each sentence pattern (G) is handled sub-device.
Step 2, the sub-device of analyzing and processing are converted into the grammatical language CL that semantic primitive and separator are separated by with interface data grammar
1(G) or form the grammatical language CL of semantic primitive by length
2(G), obtain the set of semantic primitive and separator, output semantic primitive information.
Step 3, analyzing and processing control device will be gone up a sub-device analysis and handle back output semantic primitive information and deliver to output unit or send into next height device and carry out analyzing and processing.
Step 4, the semantic primitive information of output unit after data handling system output syntax analysis treating apparatus docking port data syntax analysis is handled.
The syntax analysis treating apparatus can expand as required, adds the new sub-device of analyzing and processing.
The interface data grammar language can be converted into equivalent grammar language CL arbitrarily
1(G) or CL
2(G).Use type 2 grammar and the type 3 grammar that is at most in the text interface data grammar language, type 3 grammar is owing to can be converted into type 2 grammar, the same type 2 grammar of principle.
Type 2 grammar G={T, N, P, S} describes, and wherein the T/N/P/S implication is as follows:
T: the set of terminal symbol
N: the set of nonterminal symbol
P: the set of grammar rule A → α, A ∈ N wherein, α ∈ (N ∪ T)
*
S: the begin symbol of the syntax, S ∈ N
L (G)={ w ∈ T
*| there is the derivation S=＞* w} of G
W is a string of terminal symbol, is called sentence, and the grammatical language that type 2 grammar is described is the set from the character string of begin symbol release.As long as each production all is converted into A → w
1c
1w
2Form, w
1w
2∈ E, c
1∈ D just can guarantee that the grammatical language that the syntax produce is CL
1(G).As follows each production is transformed:
At first, interface data character production is converted into the element production, that is: any production is converted into A → α β γ form, α, beta, gamma ∈ N ∪ T
*
1) A → α is converted into A → ε α ε
2) A → α β is converted into A → α β ε
3) A → α β γ δ ... be converted into A → α β A ' A ' → γ δ
Then, the character that the user need be exported joins in the semantic primitive set, and unwanted character joins in the separator set, that is: to each production A → α β γ
1) from interface, obtain α γ, then E=E+{ alpha, gamma if desired }, D=D+{ β }
2) obtain β, then E=E+{ β from interface if desired }, the D=D+{ alpha, gamma }
3) obtain α, then E=E+{ α from interface if desired }, D=D+{ β γ }, the β γ here is the string that β and γ are linked to be
4) obtain γ, then E=E+{ γ from interface if desired }, D=D+{ α β }
At last, the semantic primitive set is removed dummy terminator respectively with the separator set, and the result is stored in the storer.That is:
E＝E-{ε}，D＝D-{ε}
Through above step, we have just changed into A → w with each production
1c
1w
2Form, obtained the set E of semantic primitive and the set D of separator simultaneously.
For 0-mode grammar, because what rule 0-mode grammar do not have to say, be the information of having only the people to understand fully substantially, the observation that therefore can only utilize the people could transform by the man-machine interface of computing machine reality terminal.Step is as follows:
1, blank character sequences such as clear and definite sequence of not carrying semantic information such as space, tab, carriage return, line feed is added separator set D.
2, the character outside the separator set is deposited in the semantic primitive set of storer.If D=is φ, to each w ∈ L (G), make E=E+{w}, promptly each sentence has only a big semantic primitive, no separator.
Type 1 grammar and type 2 grammar comparing class seemingly, the syntax also can be defined by production, just production has dependence, as the typical production of type 1 grammar is:
A → α β α is two identical α that open with the β lattice.
Utilize the disposal methods type 1 grammar identical with type 2 grammar, the language of generation is CL
1(G).
Embodiment: show that as Fig. 3 for the Binary Interface data, the present invention is that packet header of Internet protocol (IP) is used as a specific embodiment with a typical Binary Interface.The typical Binary Interface data in IP packet header have following several field:
1, fixed-length field is as version (Version), COS (Type of Service) etc.
2, length field, as head length degree (Header Length), total length (Total Length) etc., length field also is a kind of fixed-length field, it has indicated the length of back field, so be called length field.
3, variable-length field, as option (Options), the Options field can be 0～4 byte in IP packet header, but in interface instance, its length is also fixed.
In sum, do not have the notion of separator in Binary Interface, the notion of separation is hidden in the length, the present invention with length as separator.
The present invention is designated as S to the starting point of a field
n, length is designated as L
n, wherein, n is the serial number of this field in the scale-of-two syntax, increases progressively since 1; L
nLength for appointment in the interface description.
With sequence (S
n, L
n) represent semantic primitive and separator in the Binary Interface data character, this moment, separator and semantic primitive were of equal value.The length of variable-length field is uncertain, and its length obtains through after certain computing by the value of relevant length field.The present invention represents the sequence number of the length field of being correlated with m, use | (S
m, L
m) | the expression sequence number is the value of the length field of m, with the specific computing of Exp () expression.The length L of variable-length field then
n=Exp (| (S
m, L
m) |).The value that equals Header Length field as the length of " Options " in the above-mentioned IP packet header and " Padding " deducts 20.
Carry out following operation:
1) to each fixed-length field, L
nThe length of indicating in=the interface,
E＝E+{(S
n，L
n)}；
2) to each length field, with 1;
3) to each variable-length field,
L
n＝exp(|(S
m，L
m)|)，E＝E+{(S
n，L
n)}
4) make D=E
Can draw L (G)={ w
1w
2w
3W
n| w
i∈ E, | E|=n} meets CL
2(G)
After finishing above-mentioned steps, the syntax of all interface data all are converted into CL
1(G) and CL
2(G).
The syntax analysis treating apparatus is designated as UC, and the syntax analysis treating apparatus that comprises semantic primitive w is designated as UC (w), and the effective information that extracts is designated as | UC (w) |.Handling sub-device with regard to every kind of syntax below illustrates respectively.
Separate and handle sub-device, be designated as SeparateUC (D) (w), the sequence D that the semantic primitive w of the sub-device of separation processing is separated symbol is separated into one by one little semantic primitive.The present invention is w Ji Wei $0 itself, with the little semantic primitive that is separated out Ji Wei $1 in order ... $n.As: SeparateUC (("; (2) ", ". ", " xyz ")) (" 123; Xxx; A, b, c, abcxyz "), the value of this grammar processing unit output comprises:
$0＝″123；xxx；a，b，c，abcxyz″；
$1＝″123″；$1＝″xxx″；$2＝a；$3＝b；$4＝c；$5＝abc
Separator sequence ("; (2) ", ", ", " xyz ") implication be earlier with 2 "; " separate, use a plurality of arbitrarily ", " number separation up to running into next separator " xyz " then.
The separator sequence determines that method is as follows:
1, makes separator sequence SD=()
2, once c ∈ D, SD=SD+ (" c (1) ") are appearred continuously in each of sentence
If n the c ∈ D that occurs continuously in 3 sentences, SD=SD+ (" c (n) ") then, n represents the number of times of appearance continuously.
Sentence with certain equipment alarm of manufacturer is an example:
mcode?atag?REPT?ALM?EQPT
“aid_eqpts：cond_eqpt，condeff，ocrdat，ocrtm：cond_descr”；
The separator sequence that can be drawn by above step is:
(″(5)″，″\n(1)″，″\″(1)″，″：(1)″，″，(3)″，″：(1)″，″\″(1)″)
For for purpose of brevity, finish with not separating up to running into next separator or sentence with c with " c " expression of " (number of times) ", represent all blank characters with WS, then above-mentioned separator is in conjunction with writing:
(″WS″，″\n″，″\″″，″：″，″，″，″：″，″\″″)
The sub-device of type of process, be designated as TypeUC (T) (w), the semantic primitive of the sub-device of type of process must meet predefined type, and at present the type that realizes has arithmetic type such as integer, floating number, expression formula TypeUC (long), TypeUC (double), TypeUC (exp); Character string type TypeUC (string); Time type TypeUC (time).| TypeUC (T) (w) | expression w type conversion is the value of T type.As | TypeUC (long) (" 123 ") |=123.
The sub-device of mode treatment is designated as PatternUC (P) (w), and the semantic primitive of handling in the sub-device docking port data is carried out pattern match, and P is the character string of description scheme.As semantic primitive " abc-2.4defxyz ", pattern can be written as (" abc " $ " def " $), then | PatternUC (" abc " $ " def " $) (abc-2.4defxyz) |=(" 2.4 ", " xyz "), wherein can obtain character string " 2.4 ", obtain character string " xyz " by $2 by $1.
If cooperate the floating number-2.4 and the character string xyz that can obtain respectively wherein with the sub-type of device of analyzing and processing.As: | and PatternUC (" abc " TypeUC (double) is " " def ($) " $) (abc-2.4defxyz) |={ 2.4, " xyz " }
And for example: | TypeUC (time) (| PatternUC (Y:M:D h:m:s) (" 2004:11:28 17:28:25 ") || the computer representation in=2004 on November 28,17: 28: 25.
The sub-device of test processes, (w1, w2), the semantic primitive w in the sub-device docking port of the test processes data carries out the condition judgment of logical relation, exports true and false to be designated as TestUC (C).Condition C comprise=,＞,＜,＞=,＜=,!=, as: make w=" 100 ", then have
|TestUC(＝)(w，″100″)|＝TRUE，|TestUC(！＝)(w，″100)|＝FALSE
Test analysis is handled also can share with type of process and is carried out various types of condition judgment.As:
|TestUC(＝)(TypeUC(long)(w)，100)|＝TRUE
Sub-device is handled in search, is designated as SearchUC (K) (w), and the semantic primitive w that search is handled in the sub-device docking port data carries out key word K search, and key word is a character string.If search then for true: | SearchUC (K) (w) |=TRUE, otherwise be vacation: | SearchUC (K) (w) |=FALSE.Search is handled son and also be can be regarded as a kind of special test processes, and its function is whether test key word K exists.
Condition is handled sub-device, and (w) (A1, A2), the semantic primitive w that condition is handled in the sub-device docking port data tests, if the result is that the A2 statement is carried out in vacation for very then carry out the A1 statement to be designated as IfUC (T).A1, A2 are assignment statement.Condition is handled the conditional statement in the similar C language, and it can be that test processes or search are handled.As: w=" 100 " in addition then has:
IfUC (| TestUC (=) (w, " 100 ") |) ($$=" 0 " ， $$=" 1 ") |=" 1 " ， $$ represents the value of processing itself.
Length is handled sub-device, LengthUC (L), this handles sub-device mainly is at the Binary Interface data, L is expression scale-of-two separator, | LengthUC (L) | the application heap of the field that the L separator is separated in=the Binary Interface, can take out the value of particular type with the type of process cooperation.
The above is the preferred embodiments of the present invention only, is not limited to the present invention, and for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within the claim scope of the present invention.
Claims (13)
1, a kind of interface data grammar analysis process system is characterized in that, this system comprises with lower device:
Communication device, its connection device and analyzing and processing control device are used for data that accepting device the reports rower of going forward side by side and show;
The syntax analysis treating apparatus, it connects the analyzing and processing control device, comprise that at least one data syntax analysis handles sub-device, be used for interface data grammar is converted into grammatical language that semantic primitive and separator be separated by or the grammatical language that is formed semantic primitive by length, to obtain the set of semantic primitive and separator, output semantic primitive information;
The analyzing and processing control device, its end connects communication device, one end junction grammar APU is used for according to the equipment sign interface data of receiving being sent into one or several corresponding syntax analysis and handles sub-device, and the semantic primitive information of exporting after the analyzing and processing is delivered to output unit;
Output unit, it connects the analyzing and processing control device, is used for the semantic primitive information after the data application processing system output syntax analysis treating apparatus docking port data syntax analysis of outside is handled.
2, a kind of interface data grammar analysis process system according to claim 1 is characterized in that, it is separation, test, pattern, type, search, conditioned disjunction length APU that described syntax analysis is handled sub-device.
3, a kind of interface data grammar analysis and processing method is characterized in that, this method may further comprise the steps:
Step 1, analyzing and processing control device indicate the sub-device of one or several analyzing and processing of the interface data of receiving being sent into corresponding syntax analysis treating apparatus according to equipment;
Step 2, APU are converted into interface data grammar grammatical language that semantic primitive and separator be separated by or form the grammatical language of semantic primitive by length, obtain the set of semantic primitive and separator, export semantic primitive information;
The semantic primitive information that step 3, analyzing and processing control device are exported after with analyzing and processing is delivered to output unit;
Step 4, the semantic primitive information of output unit after data application processing system output syntax analysis treating apparatus docking port data syntax analysis is handled.
4, interface data grammar analysis and processing method according to claim 3 is characterized in that, the interface data in the described step 1 specifically comprise 0-type grammar data, type 1 grammar data, type 2 grammar data, type 3 grammar data and scale-of-two syntax data.
5, interface data grammar analysis and processing method according to claim 3, it is characterized in that described 0-type grammar processing method of data specifically is meant: the clear and definite character that does not carry semantic information such as space, tab, carriage return, line feed etc. are directly added the separator set and deposit in the storer; To there be the character of semantic information to deposit in the semantic primitive set of storer.
6, interface data grammar analysis and processing method according to claim 3 is characterized in that, described 2 types or type 3 grammar disposal route specifically comprise: interface data character production is converted into the element production and deposits in the storer; The character that user in the production need be exported joins in the semantic primitive set, and unwanted character joins in the separator set, and deposits storer in; Dummy terminator is removed in semantic primitive set and separator set respectively, and the result is stored in the storer.
7, interface data grammar analysis and processing method according to claim 3 is characterized in that, the sub-device of the analyzing and processing in the described step 2 is meant separating device, separates analyzing and processing and specifically may further comprise the steps:
Generate the separator sequence according to the position of the non-semantic character of interface data and the frequency of appearance, and deposit in the computer memory;
Call separation symbol sequence, the docking port data are cut apart;
Output semantic primitive information.
8, interface data grammar analysis and processing method according to claim 3, it is characterized in that, the sub-device of analyzing and processing in the described step 2 is meant types of devices, it specifically is the predefined type of semantic primitive information conforms of instigating terminal output that type analysis is handled, and these types comprise arithmetic type, character string type, time type.
9, interface data grammar analysis and processing method according to claim 3 is characterized in that, the sub-device of the analyzing and processing in the described step 2 is meant mode device, and pattern analysis is handled and specifically be may further comprise the steps:
Semantic primitive in the docking port data is carried out pattern match;
Output semantic primitive information.
10, interface data grammar analysis and processing method according to claim 3, it is characterized in that, the sub-device of analyzing and processing in the described step 2 is meant proving installation, and test analysis is handled the semantic primitive character specifically be meant in the docking port data or the logical relation between the character string is carried out true and false judgement.
11, interface data grammar analysis and processing method according to claim 3, it is characterized in that, the sub-device of analyzing and processing in the described step 2 is meant searcher, searching analysis is handled the semantic primitive character that specifically is meant in the key word docking port data of forming with character string and is searched for, and Search Results is carried out true and false judgement.
12, interface data grammar analysis and processing method according to claim 3, it is characterized in that, the sub-device of analyzing and processing in the described step 2 is meant the condition device, the relation that condition analysis is handled between the semantic primitive that specifically is meant in the docking port data is tested judgement, and according to the corresponding statement of the true and false execution of test result.
13, interface data grammar analysis and processing method according to claim 3, it is characterized in that, the sub-device of analyzing and processing in the described step 2 is meant the length device, and the length analyzing and processing specifically is meant the application heap that obtains the field that the length separator is separated in the interface data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101024521A CN100382022C (en) | 2005-09-09 | 2005-09-09 | Interface data grammar analytic processing system and its analytic processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2005101024521A CN100382022C (en) | 2005-09-09 | 2005-09-09 | Interface data grammar analytic processing system and its analytic processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1851642A true CN1851642A (en) | 2006-10-25 |
| CN100382022C CN100382022C (en) | 2008-04-16 |
Family
ID=37133121
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2005101024521A Expired - Fee Related CN100382022C (en) | 2005-09-09 | 2005-09-09 | Interface data grammar analytic processing system and its analytic processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100382022C (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103473243A (en) * | 2012-06-08 | 2013-12-25 | 富士通株式会社 | Method and device for generating semantic network service document |
| CN104641367A (en) * | 2012-09-18 | 2015-05-20 | 触摸式有限公司 | Formatting module, system and method for formatting an electronic character sequence |
| CN106776649A (en) * | 2015-11-24 | 2017-05-31 | 镇江诺尼基智能技术有限公司 | Exchange method and system are taken turns a kind of intelligent answer based on visible process figure more |
| CN110022221A (en) * | 2018-01-08 | 2019-07-16 | 车伯乐（北京）信息科技有限公司 | A kind of monitoring method of system interface data, apparatus and system |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE10337934A1 (en) * | 2002-09-30 | 2004-04-08 | Siemens Ag | Unstructured text conversion method in which the text is structured using structuring rules that operate on text fragments and sort them using terminology and subject dependent structuring rules |
| WO2005038647A1 (en) * | 2003-10-16 | 2005-04-28 | Mitsubishi Denki Kabushiki Kaisha | User interface software design system |
| US20050091036A1 (en) * | 2003-10-23 | 2005-04-28 | Hazel Shackleton | Method and apparatus for a hierarchical object model-based constrained language interpreter-parser |
-
2005
- 2005-09-09 CN CNB2005101024521A patent/CN100382022C/en not_active Expired - Fee Related
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103473243A (en) * | 2012-06-08 | 2013-12-25 | 富士通株式会社 | Method and device for generating semantic network service document |
| CN103473243B (en) * | 2012-06-08 | 2017-03-01 | 富士通株式会社 | The method and apparatus of generative semantics network service document |
| CN104641367A (en) * | 2012-09-18 | 2015-05-20 | 触摸式有限公司 | Formatting module, system and method for formatting an electronic character sequence |
| CN104641367B (en) * | 2012-09-18 | 2019-01-11 | 触摸式有限公司 | For formatting formatting module, the system and method for electronic character sequence |
| CN106776649A (en) * | 2015-11-24 | 2017-05-31 | 镇江诺尼基智能技术有限公司 | Exchange method and system are taken turns a kind of intelligent answer based on visible process figure more |
| CN110022221A (en) * | 2018-01-08 | 2019-07-16 | 车伯乐（北京）信息科技有限公司 | A kind of monitoring method of system interface data, apparatus and system |
| CN110022221B (en) * | 2018-01-08 | 2022-04-05 | 车伯乐（北京）信息科技有限公司 | System interface data monitoring method, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100382022C (en) | 2008-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1277192C (en) | A log analyzing system and analytical method based on the system | |
| CN1834955A (en) | Multilingual translation memory, translation method, and translation program | |
| CN1788266A (en) | Translation system | |
| CN1752934A (en) | Compiler, compilation method, and compilation program | |
| CN1842081A (en) | ABNF character string mode matching and analyzing method and device | |
| CN1912872A (en) | Method and system for abstracting new word | |
| CN1097883A (en) | Dictionary retrieval device | |
| CN1250189A (en) | Electronic dictionary with function of processing customary wording | |
| CN1912849A (en) | Chip dynamic tracing method of microprocessor | |
| CN1908931A (en) | Literal data variable typesetting method | |
| CN101051965A (en) | Device and method for forming topological map and detecting topological structure | |
| CN1300961C (en) | Test method | |
| CN1526104A (en) | Parsing structured data | |
| CN1851642A (en) | Interface data grammar analytic processing system and its analytic processing method | |
| CN1934565A (en) | Machine translation system, machine translation method, and program | |
| CN1809053A (en) | Universal parser for text code protocols | |
| CN1265307C (en) | Characteristic character string extracting and substituting method in language localization | |
| CN111427940A (en) | Self-adaptive database conversion method and device | |
| CN1950819A (en) | A system and method for retrieving information and a system and method for storing information | |
| CN1167011C (en) | Method of testing several kinds of application protocol | |
| CN1744092A (en) | Method and system for automatic schedule logic simulation and code coverage rate analysis | |
| CN1702650A (en) | Apparatus and method for translating Japanese into Chinese and computer program product | |
| CN101047555A (en) | Detection method for quality of equipment | |
| CN1780236A (en) | Universal testing system and method for telecommunication intelligent service | |
| CN100345116C (en) | Program automatic converting method and program automatic converting device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20080416 Termination date: 20120909 |