A method for transforming grammars into LL(k) form

DOI10.1007/BF00268320zbMATH Open0423.68039OpenAlexW2002147584MaRDI QIDQ1134533FDOQ1134533

Authors: 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)

Cites Work

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

Cited In (5)

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

Uses Software

• ALGOL 60

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

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