LR(0) Conjunctive Grammars and Deterministic Synchronized Alternating Pushdown Automata
In this paper we introduce a sub-family of synchronized alternating pushdown automata, Deterministic Synchronized Alternating Pushdown Automata, and a sub-family of conjunctive grammars, LR(0) Conjunctive Grammars. We prove that deterministic SAPDA and LR(0) conjunctive grammars have the same recognition/generation power, analogously to the classical equivalence between acceptance by empty stack of deterministic PDA and LR(0) grammars. These models form the theoretical basis for efficient, linear, parsing of a rich sub-family of conjunctive languages, which properly includes all the boolean combinations of context-free LR(0) languages.
Unable to display preview. Download preview PDF.
- 2.Aizikowitz, T.: Synchronized Alternating Pushdown Automata. PhD thesis, Technion – Israel Institute of Technology (2010), http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/2010/PHD/PHD-2010-14
- 4.Higginbotham, J.: English is not a context-free language. Linguistic Inquiry 15, 119–126 (1984)Google Scholar
- 8.Langendoen, T.D., Postal, P.M.: English and the class of context-free languages. Computational Linguistics 10(3-4), 177–181 (1984)Google Scholar
- 14.Tomita, M.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers, Norwell (1985)Google Scholar