A Method Checking the Correctness of Sentence of Formal language Based on Linear Resolution

Normally regular grammar, finite automata and regular expression are used to identify words. This paper puts forward that the derivation process for identifying words by regular grammar is a linear resolution substantively. Furthermore, in certain condition, irregular grammar can be converted to regular one and the algorithm is given in this paper. Basically, after constituted the clause sets of regular grammar, we presented a method checking the correctness of sentence of formal language based on linear resolution, which was proved to be mature in this experiment. This measure was implemented in algorithm and program as well. The result shows that our method is better than regular grammar, etc. in some aspects, such as the speed of identifying words, the program code space and the coding difficultly