On the parsing and covering of simple chain grammars
A method is presented for obtaining a simple deterministic pushdown transducer which acts as a parser for simple chain grammars. It is shown that a simple deterministic grammar can be constructed which covers the simple chain grammar. To obtain both the simple deterministic pushdown transducer and the cover result, a new type of parse is introduced which differs from the left and right parses which are common for the usual one pass no back-tracking parsing algorithms. For the simple chain grammars this parse, the so-called left part parse, follows from a simple left part property which is satisfied by the grammatical trees of simple chain grammars.
KeywordsTerminal Symbol Simple Chain Cover Result Pushdown Automaton Leftmost Derivation
Unable to display preview. Download preview PDF.
- 1.A.V. AHO and J.D. ULLMAN, The Theory of Parsing, Translation and Compiling, Vol. 1 and 2, Prentice-Hall, Englewood Cliffs, N.J., 1972 and 1973.Google Scholar
- 3.A.J. KORENJAK and J.E. HOPCROFT, Simple deterministic languages, in "7th Ann. Sympos. on Sw. and Aut. Theory, IEEE 1966", pp. 36–46.Google Scholar
- 4.A. NIJHOLT, On the covering of parsable grammars, J. Comput. System Sci. 15 (1977), pp. 99–110.Google Scholar
- 5.A. NIJHOLT, A left part theorem for grammatical trees, IR-22, Dept. of Mathematics, Vrije Universiteit Amsterdam, august 1977.Google Scholar
- 6.A. NIJHOLT, Simple chain grammars, Proceedings of the 4th Coll. on Automata, Languages and Programming 1977 (eds. A. Salomaa and M. Steinby) pp. 352–364, Lecture Notes in Computer Science 52, Springer Verlag, Berlin.Google Scholar
- 7.D.J. ROSENKRANTZ and P.M. LEWIS, Deterministic left-corner parsing, in "11th Ann. Sympos. on Sw. and Aut. Theory, IEEE 1970", pp. 139–152.Google Scholar