On the public citation graph
A Technique for Speeding up ${\text{LR}}(k)$ Parsers
0 signed · 32 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/bf01692511openalex-snapshot
Semantics of context-free 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(71)90706-6openalex-snapshot
Translations on a context free grammar
inferredcites →https://doi.org/10.1016/s0022-0000(72)80031-xopenalex-snapshot
Optimization of LR(k) parsers
inferredcites →https://doi.org/10.1145/321172.321179openalex-snapshot
Syntactic Analysis and Operator Precedence
inferredcites →https://doi.org/10.1145/321724.321732openalex-snapshot
On the Covering and Reduction Problems for Context-Free Grammars
inferredcites →https://doi.org/10.1145/363269.363281openalex-snapshot
A practical method for constructing LR ( k ) processors
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-06841-4_64openalex-snapshot
On Eliminating Unit Productions from LR(K) Parsers
inferred← citeshttps://doi.org/10.1007/3-540-09510-1_51openalex-snapshot
A modification of the LR(k) method for constructing compact bottom-up parsers
inferred← citeshttps://doi.org/10.1007/978-0-387-68954-8openalex-snapshot
Parsing Techniques: A Practical Guide
inferred← citeshttps://doi.org/10.1007/bf00263764openalex-snapshot
Eliminating unit productions from LR parsers
inferred← citeshttps://doi.org/10.1007/bf00264538openalex-snapshot
Eliminating unit reductions from LR(k) parsers using minimum contexts
inferred← citeshttps://doi.org/10.1007/bf00288542openalex-snapshot
On the space optimizing effect of eliminating single productions from LR parsers
inferred← citeshttps://doi.org/10.1007/bf00288658openalex-snapshot
An alternative approach to the improvement of LR(k) parsers
inferred← citeshttps://doi.org/10.1007/bf00290336openalex-snapshot
A practical general method for constructing LR(k) parsers
inferred← citeshttps://doi.org/10.1007/bf03036460openalex-snapshot
Disambiguating grammars by exclusion of sub-parse trees
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90082-xopenalex-snapshot
A YACC extension for LRR grammar parsing
inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91111-1openalex-snapshot
Derivational complexity of context-free grammars
inferred← citeshttps://doi.org/10.1080/00207167908803181openalex-snapshot
On a method for optimizing LR parsers
inferred← citeshttps://doi.org/10.1109/tc.1976.1674686openalex-snapshot
A Simple Technique for Partial Elimination of Unit Productions from LR(k) Parsers
inferred← citeshttps://doi.org/10.1145/2892208.2892224openalex-snapshot
Reachability and error diagnosis in LR(1) parsers
inferred← citeshttps://doi.org/10.1145/357162.357165openalex-snapshot
Inessential Error Entries and Their Use in LR Parser Optimization
inferred← citeshttps://doi.org/10.1145/512927.512928openalex-snapshot
Deterministic parsing of ambiguous grammars
inferred← citeshttps://doi.org/10.1145/512950.512967openalex-snapshot
Elimination of single productions from LR parsers in conjunction with the use of default reductions
inferred← citeshttps://doi.org/10.1145/579.357255openalex-snapshot
Technical Correspondence: Comments on Soisalon-Soininen's ``Inessential Error Entries and Their Use in LR Parser Optimization''
inferred← citeshttps://doi.org/10.1145/800168.811546openalex-snapshot
On directly constructing LR(k) parsers without chain reductions
inferred← citeshttps://doi.org/10.5120/17191-7379openalex-snapshot
Empirical Analysis of Context Free Grammars and Parse Trees
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.