On the public citation graph

Eliminating unit productions from LR parsers

https://doi.org/10.1007/bf00263764
0 signed · 34 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/3-540-06841-4_64openalex-snapshot
On Eliminating Unit Productions from LR(K) Parsers
inferredcites →https://doi.org/10.1007/bf00288658openalex-snapshot
An alternative approach to the improvement of LR(k) parsers
inferredcites →https://doi.org/10.1007/bf00290336openalex-snapshot
A practical general method for constructing LR(k) parsers
inferredcites →https://doi.org/10.1007/bf00571461openalex-snapshot
EfficientLR (1) parsers
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.1137/0202010openalex-snapshot
A Technique for Speeding up ${\text{LR}}(k)$ Parsers
inferredcites →https://doi.org/10.1145/362619.362625openalex-snapshot
Simple LR(k) grammars
inferredcites →https://doi.org/10.1145/363269.363281openalex-snapshot
A practical method for constructing LR ( k ) processors
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/365696.365702openalex-snapshot
A contribution to the development of ALGOL
inferredcites →https://doi.org/10.1145/366193.366201openalex-snapshot
Revised report on the algorithmic language ALGOL 60
inferredcites →https://doi.org/10.1145/800168.811546openalex-snapshot
On directly constructing LR(k) parsers without chain reductions

What points at this work

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

inferred← citeshttps://doi.org/10.1002/spe.4380200602openalex-snapshot
Even faster lr parsing
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/bf00288542openalex-snapshot
On the space optimizing effect of eliminating single productions from LR parsers
inferred← citeshttps://doi.org/10.1007/bf00288959openalex-snapshot
Parsing extended LR(k) grammars
inferred← citeshttps://doi.org/10.1007/bf03036460openalex-snapshot
Disambiguating grammars by exclusion of sub-parse trees
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/s0019-9958(82)91111-1openalex-snapshot
Derivational complexity of context-free grammars
inferred← citeshttps://doi.org/10.1016/s0020-0255(99)00040-7openalex-snapshot
Efficient controlling of parsing-stack operation for LR parsers
inferred← citeshttps://doi.org/10.1016/s0070-4571(08)70009-8openalex-snapshot
Chapter 4 Authigenic Green Particles From Marine Environments
inferred← citeshttps://doi.org/10.1080/00207167908803181openalex-snapshot
On a method for optimizing LR parsers
inferred← citeshttps://doi.org/10.1080/00207168408803404openalex-snapshot
On the correct elimination of chain productions from lr parsers
inferred← citeshttps://doi.org/10.1109/icsmc.1996.569864openalex-snapshot
A speeding-up method of parsing-stack operations for LR parsers
inferred← citeshttps://doi.org/10.1145/1780.1802openalex-snapshot
Optimization of parser tables for portable compilers
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/357133.357138openalex-snapshot
The Construction of Stack-Controlling LR Parsers for Regular Right Part Grammars
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/4284.4289openalex-snapshot
Extended use of null productions in LR(1) parser applications
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.