On the public citation graph

A method for transforming grammars into LL(k) form

https://doi.org/10.1007/bf00268320
0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3540069585_47openalex-snapshot
LL(1) Grammars and Analysers
inferredcites →https://doi.org/10.1007/bf00289517openalex-snapshot
Top-down syntax analysis
inferredcites →https://doi.org/10.1007/bf01946814openalex-snapshot
Notes on top-down languages
inferredcites →https://doi.org/10.1016/s0019-9958(65)90426-2openalex-snapshot
On the translation of languages from left to right
inferredcites →https://doi.org/10.1016/s0019-9958(70)90446-8openalex-snapshot
Properties of deterministic top-down grammars
inferredcites →https://doi.org/10.1093/comjnl/11.1.31openalex-snapshot
A syntax improving program
inferredcites →https://doi.org/10.1093/comjnl/12.2.139openalex-snapshot
The normal form theorem--another proof
inferredcites →https://doi.org/10.1093/comjnl/17.3.242openalex-snapshot
A note on left factored languages
inferredcites →https://doi.org/10.1109/swat.1970.5openalex-snapshot
Deterministic left corner parsing
inferredcites →https://doi.org/10.1145/321250.321254openalex-snapshot
A New Normal-Form Theorem for Context-Free Phrase Structure Grammars
inferredcites →https://doi.org/10.1145/321406.321412openalex-snapshot
Matrix Equations and Normal Forms for Context-Free Grammars
inferredcites →https://doi.org/10.1145/321466.321477openalex-snapshot
Syntax-Directed Transduction
inferredcites →https://doi.org/10.1145/357980.357986openalex-snapshot
A syntax directed compiler for ALGOL 60
inferredcites →https://doi.org/10.1145/364914.364943openalex-snapshot
On the relative efficiencies of context-free grammar
inferredcites →https://doi.org/10.1145/365719.365984openalex-snapshot
On top-to-bottom recognition and left recursion
inferredcites →https://doi.org/10.1145/366062.366083openalex-snapshot
A syntax directed compiler for ALGOL 60
inferredcites →https://doi.org/10.1145/512950.512959openalex-snapshot
On the covering of left recursive grammars
inferredcites →https://doi.org/10.1145/512950.512966openalex-snapshot
Generalized left corner parsing
inferredcites →https://doi.org/10.1145/800119.803904openalex-snapshot
A new grammatical transformation into LL(k) form (Extended Abstract)
inferredcites →https://doi.org/10.2307/2004519openalex-snapshot
Compiling Techniques

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-10245-0openalex-snapshot
Context-free grammars: Covers, normal forms, and parsing
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_77openalex-snapshot
Parsing strategies: A concise survey
inferred← citeshttps://doi.org/10.1007/978-3-642-37051-9_13openalex-snapshot
On LR Parsing with Selective Delays
inferred← citeshttps://doi.org/10.1007/bf01934444openalex-snapshot
Translations on a subclass of LR(k) grammars
inferred← citeshttps://doi.org/10.1007/bf03036460openalex-snapshot
Disambiguating grammars by exclusion of sub-parse trees
inferred← citeshttps://doi.org/10.1007/bfb0036485openalex-snapshot
A general scheme for some deterministically parsable grammars and their strong equivalents
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90038-2openalex-snapshot
On the relationship between the LL(k) and LR(k) grammars
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90026-0openalex-snapshot
Tests for the LR-, LL-, and LC-regular conditions
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90130-xopenalex-snapshot
Structure preserving elimination of null productions from context-free grammars
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90146-1openalex-snapshot
On LC(0) grammars and languages
inferred← citeshttps://doi.org/10.1137/s0097539701400154openalex-snapshot
A Powerful LL( k ) Covering Transformation
inferred← citeshttps://doi.org/10.1145/1147954.1147959openalex-snapshot
Probabilistic parsing strategies
inferred← citeshttps://doi.org/10.3115/1218955.1219024openalex-snapshot
Probabilistic parsing strategies
inferred← citeshttps://doi.org/10.3115/976744.976780openalex-snapshot
Generalized left-corner parsing
inferred← citeshttps://doi.org/10.3115/981732.981749openalex-snapshot
An optimal tabular parsing algorithm
inferred← citeshttps://doi.org/10.3115/981732.981761openalex-snapshot
An extended theory of head-driven parsing
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.