On the public citation graph
The size of LALR (1) parsers
0 signed · 25 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf01940891openalex-snapshot
Generation of permutations in lexicographical order
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)90379-7openalex-snapshot
A solution to an open problem by Knuth
inferredcites →https://doi.org/10.1145/321172.321179openalex-snapshot
Syntactic Analysis and Operator Precedence
inferredcites →https://doi.org/10.1145/357980.358005openalex-snapshot
An efficient context-free parsing algorithm
inferredcites →https://doi.org/10.1145/362705.362712openalex-snapshot
A technique for generating almost optimal Floyd-Evans productions for precedence grammars
inferredcites →https://doi.org/10.1145/363921.363927openalex-snapshot
Bounded context syntactic analysis
inferredcites →https://doi.org/10.1145/364914.364943openalex-snapshot
On the relative efficiencies of context-free grammar
inferredcites →https://doi.org/10.1145/365153.365162openalex-snapshot
EULER: A generalization of ALGOL and its formal definition: Part 1
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1145/800152.804920openalex-snapshot
A technique for speeding up LR(k) parsers
inferredcites →https://doi.org/10.13182/nse70-a19706openalex-snapshot
Formal Languages and their Relation to Automata
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-1-4615-4034-2_8openalex-snapshot
GLR Parsing With Probability
inferred← citeshttps://doi.org/10.1007/978-3-540-73420-8_60openalex-snapshot
Conservative Ambiguity Detection in Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/bf00286489openalex-snapshot
Semantic routines and LR(k) parsers
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90010-7openalex-snapshot
Lower bounds on the size of deterministic parsers
inferred← citeshttps://doi.org/10.1016/0096-0551(94)90016-7openalex-snapshot
Grammar transformations for optimizing backtrack parsers
inferred← citeshttps://doi.org/10.1016/0885-2308(90)90013-vopenalex-snapshot
LR parsing of probabilistic grammars with input uncertainty for speech recognition
inferred← citeshttps://doi.org/10.1016/j.entcs.2008.03.045openalex-snapshot
An Experimental Ambiguity Detection Tool
inferred← citeshttps://doi.org/10.1016/j.scico.2009.07.002openalex-snapshot
An experimental ambiguity detection tool
inferred← citeshttps://doi.org/10.1145/2892208.2892224openalex-snapshot
Reachability and error diagnosis in LR(1) parsers
inferred← citeshttps://doi.org/10.3115/976744.976780openalex-snapshot
Generalized left-corner 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.