A method for transforming grammars into LL(k) form
From MaRDI portal
(Redirected from Publication:1134533)
Cites work
- scientific article; zbMATH DE number 3485226 (Why is no real title available?)
- scientific article; zbMATH DE number 3502750 (Why is no real title available?)
- scientific article; zbMATH DE number 3548373 (Why is no real title available?)
- scientific article; zbMATH DE number 3564359 (Why is no real title available?)
- scientific article; zbMATH DE number 3599507 (Why is no real title available?)
- scientific article; zbMATH DE number 3314344 (Why is no real title available?)
- scientific article; zbMATH DE number 3407119 (Why is no real title available?)
- A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
- A note on left factored languages
- A syntax directed compiler for ALGOL 60
- A syntax improving program
- Matrix Equations and Normal Forms for Context-Free Grammars
- Notes on top-down languages
- On the covering of parsable grammars
- On the relative efficiencies of context-free grammar
- On the translation of languages from left to right
- On top-to-bottom recognition and left recursion
- Optimization of LR(k) parsers
- Properties of deterministic top-down grammars
- Syntax-Directed Transduction
- The normal form theorem--another proof
- Top-down syntax nalysis
Cited in
(5)
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)