On the public citation graph

Notes on top-down languages

https://doi.org/10.1007/bf01946814
0 signed · 35 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.1109/swat.1966.22openalex-snapshot
Simple deterministic languages
inferredcites →https://doi.org/10.1145/321466.321477openalex-snapshot
Syntax-Directed Transduction
inferredcites →https://doi.org/10.1145/365719.365984openalex-snapshot
On top-to-bottom recognition and left recursion

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-57163-9_25openalex-snapshot
On the complexities of linear LL(1) and LR(1) grammars
inferred← citeshttps://doi.org/10.1007/3540069585_47openalex-snapshot
LL(1) Grammars and Analysers
inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_24openalex-snapshot
On the Transformation of LL(k)-linear Grammars to LL(1)-linear
inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_25openalex-snapshot
The Hardest LL(k) Language
inferred← citeshttps://doi.org/10.1007/978-3-642-67081-7_6openalex-snapshot
Kontextfreie Sprachen, Fortsetzung
inferred← citeshttps://doi.org/10.1007/bf00268320openalex-snapshot
A method for transforming grammars into LL(k) form
inferred← citeshttps://doi.org/10.1007/bf00289517openalex-snapshot
Top-down syntax analysis
inferred← citeshttps://doi.org/10.1007/bf01068715openalex-snapshot
Formal grammars which take account of external terminal contexts
inferred← citeshttps://doi.org/10.1007/bf01069653openalex-snapshot
Syntactic properties of recursive program schemes
inferred← citeshttps://doi.org/10.1007/bf01069938openalex-snapshot
An approach to the problem of syntactic analysis
inferred← citeshttps://doi.org/10.1007/bf01070336openalex-snapshot
Automaton characteristic of methods of syntactic analysis with regular control
inferred← citeshttps://doi.org/10.1007/bf01074232openalex-snapshot
Syntactic analysis of CF-languages by deterministic pushdown automata
inferred← citeshttps://doi.org/10.1007/bf01085017openalex-snapshot
Theory of formal grammars
inferred← citeshttps://doi.org/10.1007/bf01932269openalex-snapshot
A characterization ofLL(1) grammars
inferred← citeshttps://doi.org/10.1007/bf01935868openalex-snapshot
A note on top-down deterministic languages
inferred← citeshttps://doi.org/10.1007/s00224-022-10108-6openalex-snapshot
On the Transformation of LL(k)-linear to LL(1)-linear Grammars
inferred← citeshttps://doi.org/10.1007/s00236-006-0031-yopenalex-snapshot
Parallel LL parsing
inferred← citeshttps://doi.org/10.1007/s00236-006-0032-xopenalex-snapshot
Parallel LL parsing
inferred← citeshttps://doi.org/10.1007/s00236-007-0045-0openalex-snapshot
Recursive descent parsing for Boolean grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(75)90009-5openalex-snapshot
LL-regular grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90217-2openalex-snapshot
Parallel parsing on the connection machine
inferred← citeshttps://doi.org/10.1016/j.cosrev.2013.06.001openalex-snapshot
Conjunctive and Boolean grammars: The true general case of the context-free grammars
inferred← citeshttps://doi.org/10.1016/j.ipl.2003.10.006openalex-snapshot
A characterization of s-languages
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.028openalex-snapshot
Streaming algorithms for language recognition problems
inferred← citeshttps://doi.org/10.1016/s0019-9958(70)90446-8openalex-snapshot
Properties of deterministic top-down grammars
inferred← citeshttps://doi.org/10.1051/ita/1990240302411openalex-snapshot
Epsilon weak precedence grammars and languages
inferred← citeshttps://doi.org/10.1109/spw72489.2026.00005openalex-snapshot
Seventy Years of Parsing: Theoretical and Practical Consequences
inferred← citeshttps://doi.org/10.1142/s012905412344001xopenalex-snapshot
The Hardest LL(k) Language
inferred← citeshttps://doi.org/10.1145/800105.803402openalex-snapshot
Iteration theorems for LL(k) languages (Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800169.805431openalex-snapshot
Properties of deterministic top down grammars
inferred← citeshttps://doi.org/10.48550/arxiv.2010.07874openalex-snapshot
The LL(finite) strategy for optimal LL(k) 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.