✦ LIBER ✦

Recursive descent parsing for Boolean grammars

✍ Scribed by Alexander Okhotin

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 305 KB
Volume: 44
Category: Article
ISSN: 0001-5903
DOI: 10.1007/s00236-007-0045-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

LR parsing for affix grammars

✍ Werner Pohlmann 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 795 KB

Parsing of edNLC-graph grammars for scen

Parsing of edNLC-graph grammars for scene analysis

✍ Mariusz Flasiński 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 496 KB

A recognition and parsing algorithm for

A recognition and parsing algorithm for arbitrary conjunctive grammars

✍ Alexander Okhotin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Conjunctive grammars are basically context-free grammars with an explicit set intersection operation added to the formalism of rules. This paper presents a cubic-time recognition and parsing algorithm for this family of grammars, which is applicable to an arbitrary conjunctive grammar without any in

SLR(1) and LALR(1) parsing for unrestric

SLR(1) and LALR(1) parsing for unrestricted grammars

✍ Lawrence A. Harris 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 930 KB

A method for the inference of non-recurs

A method for the inference of non-recursive context-free grammars

✍ C. Chirathamjaree; Martin H. Ackroyd 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 438 KB

A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from a set of strings that the cfg is required to be capable of producing. The method is efficient in computing time by comparison with enumerative methods.