The Parsing for General Phrase-Structure Grammars

Pushdown automata serve as a base for the description of four basic parsing techniques for general phrase-structure grammars (Chomsky O-type grammars).

[1]  Sheila A. Greibach,et al.  Formal parsing systems , 1964, Commun. ACM.

[2]  Donald E. Knuth,et al.  On the Translation of Languages from Left to Right , 1965, Inf. Control..

[3]  Robert W. Floyd,et al.  Bounded context syntactic analysis , 1964, CACM.

[4]  Edgar T. Irons.  An error-correcting parse algorithm , 1963, CACM.

[5]  R. James Evey,et al.  Application of pushdown-store machines , 1899, AFIPS '63 (Fall).

[6]  Timothy V. Griffiths.  Some Remarks on Derivations in General Rewriting Systems , 1968, Inf. Control..

[7]  Niklaus Wirth,et al.  EULER: A generalization of ALGOL and its formal definition: Part 1 , 1966, Commun. ACM.

[8]  Robert W. Floyd,et al.  Syntactic Analysis and Operator Precedence , 1963, JACM.

[9]  Kirk Sattley,et al.  Syntax-directed compiling , 1964, AFIPS '64 (Spring).

[10]  Jerome A. Feldman,et al.  Translator writing systems , 1968, Commun. ACM.

[11]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[12]  H. Langmaack,et al.  Präzisierung der Begriffe Phrasenstruktur und Strukturelle Mehrdeutigkeit in Chomsky-Sprachen , 1967 .

[13]  Seymour Ginsburg,et al.  One-way nondeterministic real-time list-storage languages , 1968, JACM.

[14]  David Gries.  Use of transition matrices in compiling , 1968, CACM.

[15]  Edgar T. Irons,et al.  “Structural connections” in formal languages , 1964, CACM.

[16]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

[17]  Patrick C. Fischer,et al.  Multi-tape and infinite-state automata—a survey , 1965, Commun. ACM.

[18]  S. R. Petrick,et al.  Top-down versus bottom-up analysis , 1968, IFIP Congress.

[19]  Jeffrey S. Rohl,et al.  The compiler compiler , 1963 .

[20]  S. R. Petrick,et al.  On the relative efficiencies of context-free grammar , 1965, CACM.

[21]  Niklaus Wirth,et al.  EULER: a generalization of ALGOL, and its formal definition: Part II , 1965, CACM.

[22]  Thomas V. Griffiths.  Turing machine recognizers for general rewriting systems , 1964, SWCT.

[23]  J. J. Florentin,et al.  A Universal Syntax-Directed Top-Down Analyzer , 1968, JACM.