On top-to-bottom recognition and left recursion
From MaRDI portal
Publication:5512450
DOI10.1145/365719.365984zbMATH Open0138.10107OpenAlexW2152445600MaRDI QIDQ5512450FDOQ5512450
Authors: Reino Kurki-Suonio 
Publication date: 1966
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/365719.365984
Cited In (8)
- The ELL(1) parser generator and the error recovery mechanism
- Title not available (Why is that?)
- A survey of normal form covers for context-free grammars
- Notes on top-down languages
- On the covering problem for left-recursive grammars
- On linear languages recognized by deterministic biautomata
- A method for transforming grammars into LL(k) form
- Title not available (Why is that?)
This page was built for publication: On top-to-bottom recognition and left recursion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5512450)
