Context-free grammars: covers, normal forms, and parsing
From MaRDI portal
Publication:1160489
zbMath0477.68077MaRDI QIDQ1160489
Publication date: 1980
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
translationsgrammatical coversparsing strategiessimple chain grammarstransformation between grammarstransformations between subclasses of context-free grammars which are deterministically parsable
Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20) Research exposition (monographs, survey articles) pertaining to computer science (68-02) General topics in the theory of software (68N01)
Related Items (12)
Testing for grammatical coverings ⋮ Deterministic grammars and grammar morphisms ⋮ Finding the smallest binarization of a CFG is NP-hard ⋮ Auatomatic syntactic and context analysis in program translation systems ⋮ Structure preserving elimination of null productions from context-free grammars ⋮ On LLP(k) parsers ⋮ Translations on a subclass of LR(k) grammars ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Unnamed Item ⋮ SLR(k) covering for LR(k) grammars ⋮ Constructing a realtime deterministic pushdown automaton from a grammar ⋮ On derivation preservation
This page was built for publication: Context-free grammars: covers, normal forms, and parsing
