✦ LIBER ✦

LR parsing for affix grammars

✍ Scribed by Werner Pohlmann

Publisher: Springer-Verlag
Year: 1983
Tongue: English
Weight: 795 KB
Volume: 20
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00264275

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recursive descent parsing for Boolean gr

Recursive descent parsing for Boolean grammars

✍ Alexander Okhotin 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 305 KB

A shift-first strategy for interleaved L

A shift-first strategy for interleaved LR parsing

✍ Yong-Seok Lee; Jun-Ichi Aoe; Hideto Tomabechi 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 638 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 direct complement construction for(LR(

A direct complement construction for(LR(1))grammars

✍ Stephan Heilbrunner 📂 Article 📅 1996 🏛 Springer-Verlag 🌐 English ⚖ 197 KB