Ll-regular grammars

DOI10.1080/00207168008803216zbMATH Open0452.68083OpenAlexW2028512561WikidataQ126244550 ScholiaQ126244550MaRDI QIDQ3899533FDOQ3899533

Authors: Anton Nijholt 

Publication date: 1980

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168008803216

zbMATH Keywords

context-free grammars

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Theory of compilers and interpreters (68N20)

Cites Work

• Properties of deterministic top-down grammars
• LR-regular grammars - an extension of LR(k) grammars
• LL-regular grammars
• On LL-regular grammars
• Two iteration theorems for the LL(k) languages
• On LR(k) grammars and languages
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Look-ahead on pushdowns
• The equivalence problem for LL- and LR-regular grammars

This page was built for publication: Ll-regular grammars

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3899533)