On the public citation graph
A practical general method for constructing LR(k) parsers
0 signed · 65 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/3-540-06841-4_64openalex-snapshot
On Eliminating Unit Productions from LR(K) Parsers
inferredcites →https://doi.org/10.1016/0016-0032(63)90871-8openalex-snapshot
An introduction to mathematical machine theory
inferredcites →https://doi.org/10.1016/0020-0255(77)90036-6openalex-snapshot
The lane-tracing algorithm for constructing LR (k) parsers and ways of enhancing its efficiency
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.1016/s0022-0000(72)80031-xopenalex-snapshot
Optimization of LR(k) parsers
inferredcites →https://doi.org/10.1093/comjnl/11.2.176openalex-snapshot
Sequential Machines and Automata Theory
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1137/0202010openalex-snapshot
A Technique for Speeding up ${\text{LR}}(k)$ Parsers
inferredcites →https://doi.org/10.1145/360933.360969openalex-snapshot
Deterministic parsing of ambiguous grammars
inferredcites →https://doi.org/10.1145/363269.363281openalex-snapshot
A practical method for constructing LR ( k ) processors
inferredcites →https://doi.org/10.1145/512927.512928openalex-snapshot
Deterministic parsing of ambiguous grammars
inferredcites →https://doi.org/10.1145/800184.810522openalex-snapshot
On the construction of LR(k) analyzers
inferredcites →https://doi.org/10.2307/2004142openalex-snapshot
An Introduction to Mathematical Machine Theory
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-53669-8_77openalex-snapshot
A tool box for compiler construction
inferred← citeshttps://doi.org/10.1007/978-3-319-09704-6_8openalex-snapshot
Complexity of Extended vs. Classic LR Parsers
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_20openalex-snapshot
Validating LR(1) Parsers
inferred← citeshttps://doi.org/10.1007/bf00263764openalex-snapshot
Eliminating unit productions from LR parsers
inferred← citeshttps://doi.org/10.1007/bf00264024openalex-snapshot
Constructing LR parsers for regular right part grammars
inferred← citeshttps://doi.org/10.1007/bf00264538openalex-snapshot
Eliminating unit reductions from LR(k) parsers using minimum contexts
inferred← citeshttps://doi.org/10.1007/bf00267043openalex-snapshot
Truly prefix-correct chain-free LR(1) parsers
inferred← citeshttps://doi.org/10.1007/bf00286489openalex-snapshot
Semantic routines and LR(k) parsers
inferred← citeshttps://doi.org/10.1007/bf01407953openalex-snapshot
Parallel construction of SLR (1) and LALR (1) parsers
inferred← citeshttps://doi.org/10.1007/bf01941463openalex-snapshot
Diagnostics on LALR(k) conflicts based on a method for LR(k) Testing
inferred← citeshttps://doi.org/10.1007/s10515-010-0063-yopenalex-snapshot
Efficient monitoring of parametric context-free patterns
inferred← citeshttps://doi.org/10.1016/0020-0190(81)90052-1openalex-snapshot
A new method for implementing LR(k) tables
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90093-2openalex-snapshot
A practical method for finding the optimum postponement transformation for LR(k) parsers
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90079-3openalex-snapshot
Simple computation of LALR(1) lookahead sets
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90134-uopenalex-snapshot
On the reduction of LR(k) parsers
inferred← citeshttps://doi.org/10.1016/0020-0255(77)90036-6openalex-snapshot
The lane-tracing algorithm for constructing LR (k) parsers and ways of enhancing its efficiency
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90037-lopenalex-snapshot
Practical arbitrary lookahead LR parsing
inferred← citeshttps://doi.org/10.1016/0096-0551(90)90021-gopenalex-snapshot
Incremental generation of LR parsers
inferred← citeshttps://doi.org/10.1016/0167-6423(86)90006-7openalex-snapshot
Cigale: A tool for interactive grammar construction and expression parsing
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90067-0openalex-snapshot
A parsing automata approach to LR theory
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/j.cola.2020.100944openalex-snapshot
Morbig: A Static parser for POSIX shell
inferred← citeshttps://doi.org/10.1016/j.scico.2009.08.001openalex-snapshot
The IELR(1) algorithm for generating minimal LR(1) parser tables for non-LR(1) grammars with conflict resolution
inferred← citeshttps://doi.org/10.1080/00207168408803404openalex-snapshot
On the correct elimination of chain productions from lr parsers
inferred← citeshttps://doi.org/10.1080/00207168808803647openalex-snapshot
A general model for fixed look-ahead lr parsers
inferred← citeshttps://doi.org/10.1080/00207169508804370openalex-snapshot
Suffix languages in Lr parsing
inferred← citeshttps://doi.org/10.1109/ase.2008.25openalex-snapshot
Efficient Monitoring of Parametric Context-Free Patterns
inferred← citeshttps://doi.org/10.1109/aswec.2005.36openalex-snapshot
Parsing and Semantic Modelling for Software Engineering Applications
inferred← citeshttps://doi.org/10.1109/pccc.1989.37405openalex-snapshot
Relation-based algorithms for generating SLR(1) and LALR(1) parsers
inferred← citeshttps://doi.org/10.1109/tse.1981.230837openalex-snapshot
LR—Automatic Parser Generator and LR(1) Parser
inferred← citeshttps://doi.org/10.1145/12276.13325openalex-snapshot
A practical arbitrary look-ahead LR parsing technique
inferred← citeshttps://doi.org/10.1145/13310.13325openalex-snapshot
A practical arbitrary look-ahead LR parsing technique
inferred← citeshttps://doi.org/10.1145/1992896.1992907openalex-snapshot
Full LR(1) parser generator Hyacc and study on the performance of LR(1) algorithms
inferred← citeshttps://doi.org/10.1145/3064848openalex-snapshot
A Simple, Possibly Correct LR Parser for C11
inferred← citeshttps://doi.org/10.1145/3276604.3276615openalex-snapshot
Morbig: a static parser for POSIX shell
inferred← citeshttps://doi.org/10.1145/3486608.3486903openalex-snapshot
Faster reachability analysis for LR(1) parsers
inferred← citeshttps://doi.org/10.1145/357121.357126openalex-snapshot
Methods for Computing LALR( k ) Lookahead
inferred← citeshttps://doi.org/10.1145/357133.357138openalex-snapshot
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
inferred← citeshttps://doi.org/10.1145/4284.4289openalex-snapshot
Extended use of null productions in LR(1) parser applications
inferred← citeshttps://doi.org/10.1145/502874.502879openalex-snapshot
A Fortran compiler for the FPS-164 scientific computer
inferred← citeshttps://doi.org/10.1145/502949.502879openalex-snapshot
A Fortran compiler for the FPS-164 scientific computer
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/57669.57684openalex-snapshot
Efficient full LR(I) parser generation
inferred← citeshttps://doi.org/10.26021/2366openalex-snapshot
Understanding and Improving Object-Oriented Software Through Static Software Analysis
inferred← citeshttps://doi.org/10.48550/arxiv.2110.00776openalex-snapshot
Minimizing LR(1) State Machines is NP-Hard
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.