✦ LIBER ✦

Parsing extendedLR(k)grammars

✍ Scribed by Paul Walton Purdom; Cynthia A. Brown

Publisher: Springer-Verlag
Year: 1981
Tongue: English
Weight: 637 KB
Volume: 15
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00288959

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On parsing two-level grammars

✍ Lutz Michael Wegner 📂 Article 📅 1980 🏛 Springer-Verlag 🌐 English ⚖ 941 KB

LR parsing for affix grammars

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

Chart parsing of scattered context gramm

Chart parsing of scattered context grammars

✍ F. Popowich 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 544 KB

scattered context grammars are a class of context-sensitive grammars. The rules of these grammars can be viewed ss sequences of traditional context-free grammar rules. We show how a chart-parsing algorithm for context-free grammars can be extended to scattered context grammars. ## 1. SCATTERED CONT

Parsing regular grammars with finite loo

Parsing regular grammars with finite lookahead

✍ Thomas J. Ostrand; Marvin C. Paull; Elaine J. Weyuker 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 795 KB

Recursive descent parsing for Boolean gr

Recursive descent parsing for Boolean grammars

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

Parsing as abstract interpretation of gr

Parsing as abstract interpretation of grammar semantics

✍ Patrick Cousot; Radhia Cousot 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 153 KB

Earley's parsing algorithm is shown to be an abstract interpretation of a reÿnement of the derivation semantics of context-free grammars.