Two iteration theorems for the LL(k) languages
From MaRDI portal
Cites work
- A helpful result for proving inherent ambiguity
- A left part theorem for grammatical trees
- A necessary and sufficient condition for a power language to be LL(k)
- A strong pumping lemma for context-free languages
- Characteristic parsing: A framework for producing compact deterministic parsers. II
- Deterministic parsing of ambiguous grammars
- scientific article; zbMATH DE number 3174044 (Why is no real title available?)
- scientific article; zbMATH DE number 3485226 (Why is no real title available?)
- Intercalation theorems for stack languages
- Iteration theorems for families of strict deterministic languages
- On LR(k) grammars and languages
- On the Parsing of Deterministic Languages
- Pascal. User manual and report
- Properties of deterministic top-down grammars
- Revised report on the algorithmic language ALGOL 60
- Syntax-Directed Transduction
- Two iteration theorems for some families of languages
- Two iteration theorems for the LL(k) languages
Cited in
(11)- A pumping lemma for real-time deterministic context-free languages
- The interchange or pump (di)lemmas for context-free languages
- A pumping lemma for deterministic context-free languages
- Iteration theorems for families of strict deterministic languages
- Two iteration theorems for the LL(k) languages
- On the relationship between the LL(k) and LR(k) grammars
- On satisfying the LL-iteration theorem
- On LC(0) grammars and languages
- A metatheorem for undecidable properties of formal languages and its application to LRR and LLR grammars and languages
- Ll-regular grammars
- Rediscovering pushdown machines
This page was built for publication: Two iteration theorems for the LL(k) languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148695)
