论文信息 - On the linear computational complexity of the parser for quasi-context sensitive languages

On the linear computational complexity of the parser for quasi-context sensitive languages

An efficient, O(n), parsing algorithm for languages generated by dynamically programmed grammars, so-called DPLL(k) grammars, is presented. The class of grammars is stronger descriptively than context-free grammars and it can be used for analysis of complex trend functions describing the behaviour of an industrial equipment.

Janusz Jurek

[1] King-Sun Fu,et al. Syntactic Pattern Recognition And Applications , 1968 .

[2] Alfred V. Aho,et al. The Theory of Parsing, Translation, and Compiling , 1972 .

[3] Daniel J. Rosenkrantz,et al. Properties of deterministic top down grammars , 1969, STOC.

[4] Mariusz Flasiński,et al. Recent developments of the ZEUS expert system ZEX , 1996 .

[5] Mariusz Flasinski,et al. Dynamically programmed automata for quasi context sensitive languages as a tool for inference support in pattern recognition-based real-time control expert systems , 1999, Pattern Recognit..

[6] J. N. Stamenov,et al. Further development of the , 1995 .

[7] Daniel J. Rosenkrantz,et al. Programmed Grammars and Classes of Formal Languages , 1969, JACM.