LL-regular grammars

DOI10.1016/0020-0190(75)90009-5zbMath0314.68026OpenAlexW1985025308MaRDI QIDQ1220793

Tomasz Krawczyk, Stanislaw Jarzabek

Publication date: 1975

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(75)90009-5

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

The equivalence problem for LL- and LR-regular grammars ⋮ An extension of context-free grammars with one-sided context specifications ⋮ Unnamed Item ⋮ Look-ahead on pushdowns ⋮ On LL-regular grammars ⋮ Ll-regular grammars ⋮ Tests for the LR-, LL-, and LC-regular conditions

Cites Work

• LR-regular grammars - an extension of LR(k) grammars
• Syntax-Directed Transduction
• Notes on top-down languages
• Properties of deterministic top-down grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: LL-regular grammars