The equivalence problem for LL- and LR-regular grammars
From MaRDI portal
Publication:1162821
DOI10.1016/0022-0000(82)90044-7zbMath0482.68070MaRDI QIDQ1162821
Publication date: 1982
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://research.utwente.nl/en/publications/the-equivalence-problem-for-ll-and-lrregular-grammars(8b69ffc3-cabf-42ff-8c10-b428b026a68e).html
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the relationship between the LL(k) and LR(k) grammars
- LL-regular grammars
- A direct algorithm for checking equivalence of LL(k) grammars
- On equivalence of grammars through transformation trees
- On LL-regular grammars
- LR-regular grammars - an extension of LR(k) grammars
- Strict deterministic grammars
- The equivalence problem for real-time strict deterministic languages
- Ll-regular grammars
- Some remarks on the KH algorithm fors-grammars
- Properties of deterministic top-down grammars
- Real-Time Strict Deterministic Languages