Recursive descent parsing for Boolean grammars

The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally defined by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down to linear.

[1]  Seymour Ginsburg,et al.  Two Families of Languages Related to ALGOL , 1962, JACM.

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

[3]  K. Taira.  Proof of Theorem 1.3 , 2004 .

[4]  Michal Wrona.  Stratified Boolean Grammars , 2005, MFCS.

[5]  Notes on top-down languages , 1969 .

[6]  Adam Megacz.  Scannerless Boolean Parsing , 2006, Electron. Notes Theor. Comput. Sci..

[7]  Sheila A. Greibach,et al.  A New Normal-Form Theorem for Context-Free Phrase Structure Grammars , 1965, JACM.

[8]  Alexander Okhotin.  Top-Down Parsing of Conjunctive Languages , 2002, Grammars.

[9]  Richard Edwin Stearns,et al.  Syntax-Directed Transduction , 1966, JACM.

[10]  Alexander Okhotin,et al.  Conjunctive Grammars , 2001, J. Autom. Lang. Comb..

[11]  Ceriel J. H. Jacobs,et al.  A programmer‐friendly LL(1) parser generator , 1988, Softw. Pract. Exp..

[12]  Alexander Okhotin,et al.  The dual of concatenation , 2005, Theor. Comput. Sci..

[13]  Brian A. Wichmann,et al.  Rationale for the design of the Ada programming language , 1979, SIGP.

[14]  Bryan Ford,et al.  Parsing expression grammars: a recognition-based syntactic foundation , 2004, POPL '04.

[15]  Daniel J. Rosenkrantz,et al.  Properties of Deterministic Top-Down Grammars , 1970, Inf. Control..

[16]  Alexander Okhotin.  Boolean grammars , 2004, Inf. Comput..

[17]  Panos Rondogiannis,et al.  Well-founded semantics for Boolean grammars , 2009, Inf. Comput..

[18]  Peter Norvig,et al.  Techniques for Automatic Memoization with Applications to Context-Free Parsing , 1991, CL.

[19]  Jeffrey D. Ullman,et al.  Parsing Algorithms with Backtrack , 1970, SWAT.

[20]  Derick Wood,et al.  The Theory of Left Factored Languages: Part 2 , 1970, Computer/law journal.

[21]  Alfred V. Aho,et al.  Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[22]  Donald E. Knuth,et al.  Top-down syntax analysis , 1971, Acta Informatica.

[23]  Ravi Sethi,et al.  Yacc: a parser generator , 1990 .

[24]  Alexander Okhotin,et al.  Generalized Lr Parsing Algorithm for Boolean Grammars , 2006, Int. J. Found. Comput. Sci..

[25]  Russell W. Quong,et al.  ANTLR: A predicated‐LL(k) parser generator , 1995, Softw. Pract. Exp..