A method for transforming grammars into LL(k) form

DOI10.1007/BF00268320zbMath0423.68039OpenAlexW2002147584MaRDI QIDQ1134533

Eljas Soisalon-Soininen, Esko Ukkonen

Publication date: 1979

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00268320

zbMATH Keywords

LL(k) grammarsgrammatical coveringgrammatical transformationparsing in context-free grammars

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Related Items (5)

Structure preserving elimination of null productions from context-free grammars ⋮ Translations on a subclass of LR(k) grammars ⋮ On the relationship between the LL(k) and LR(k) grammars ⋮ On LC(0) grammars and languages ⋮ Tests for the LR-, LL-, and LC-regular conditions

Uses Software

• ALGOL 60

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the covering of parsable grammars
• Top-down syntax nalysis
• Optimization of LR(k) parsers
• A syntax directed compiler for ALGOL 60
• A note on left factored languages
• On the relative efficiencies of context-free grammar
• A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
• On top-to-bottom recognition and left recursion
• Matrix Equations and Normal Forms for Context-Free Grammars
• A syntax improving program
• Syntax-Directed Transduction
• The normal form theorem--another proof
• Notes on top-down languages
• Properties of deterministic top-down grammars
• On the translation of languages from left to right

This page was built for publication: A method for transforming grammars into LL(k) form