On the public citation graph

Semantic routines and LR(k) parsers

https://doi.org/10.1007/bf00286489
0 signed · 33 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/bf00276181openalex-snapshot
The parsing problem for affix grammars
inferredcites →https://doi.org/10.1007/bf00290336openalex-snapshot
A practical general method for constructing LR(k) parsers
inferredcites →https://doi.org/10.1007/bf01931697openalex-snapshot
Automatic program indentation
inferredcites →https://doi.org/10.1007/bf01933232openalex-snapshot
The size of LALR (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.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/357062.357071openalex-snapshot
A fast algorithm for finding dominators in a flowgraph
inferredcites →https://doi.org/10.1145/357980.358005openalex-snapshot
An efficient context-free parsing algorithm
inferredcites →https://doi.org/10.1145/362835.362838openalex-snapshot
Object code optimization

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.4380140405openalex-snapshot
A methodology and notation for compiler front end design
inferred← citeshttps://doi.org/10.1002/spe.4380200805openalex-snapshot
LR parsing of CFGs with restrictions
inferred← citeshttps://doi.org/10.1007/3-540-10250-7_30openalex-snapshot
Attribute-influenced LR parsing
inferred← citeshttps://doi.org/10.1007/3-540-53669-8_70openalex-snapshot
Recursive ascent-descent parsers
inferred← citeshttps://doi.org/10.1007/3-540-54572-7_4openalex-snapshot
Implementation of visit-oriented attribute evaluators
inferred← citeshttps://doi.org/10.1007/3-540-55844-6_133openalex-snapshot
Strictness analysis for attribute grammars
inferred← citeshttps://doi.org/10.1007/3-540-55984-1_3openalex-snapshot
Syntax directed translation with LR parsing
inferred← citeshttps://doi.org/10.1007/3-540-63774-5_123openalex-snapshot
The output-store formal translator directed by LR parsing
inferred← citeshttps://doi.org/10.1007/978-3-642-68355-8_12openalex-snapshot
LL- and LR-Attributed Grammars
inferred← citeshttps://doi.org/10.1007/bf01931659openalex-snapshot
Uncle-attributed grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90095-5openalex-snapshot
L-attributed LL(1)-grammars are LR-attributed
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90196-7openalex-snapshot
ECLR-attributed grammars: A practical class of LR-attributed grammars
inferred← citeshttps://doi.org/10.1016/0096-0551(89)90028-3openalex-snapshot
Semantic predicates in parser generators
inferred← citeshttps://doi.org/10.1016/0096-0551(93)90027-xopenalex-snapshot
Recursive ascent-descent parsing
inferred← citeshttps://doi.org/10.1016/b978-0-12-037103-7.50008-5openalex-snapshot
Attribute Grammar Evaluation System for Natural-Language Processing
inferred← citeshttps://doi.org/10.1016/j.cl.2017.06.002openalex-snapshot
On different LL and LR parsers used in LLLR parsing
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.08.032openalex-snapshot
TOOL PAPER: ScalaBison Recursive Ascent-Descent Parser Generator
inferred← citeshttps://doi.org/10.1109/iccse.2009.5228318openalex-snapshot
VPGE - A fast practical GLR parser generator
inferred← citeshttps://doi.org/10.1109/seaa.2009.14openalex-snapshot
A Generative Approach to the Construction of Application-Specific XML Processing Components
inferred← citeshttps://doi.org/10.1145/2480362.2480682openalex-snapshot
LLLR parsing
inferred← citeshttps://doi.org/10.1145/4472.4486openalex-snapshot
Affix grammar driven code generation
inferred← citeshttps://doi.org/10.1145/502874.502892openalex-snapshot
A specification language for one-pass semantic analysis
inferred← citeshttps://doi.org/10.6688/jise.2002.18.3.3openalex-snapshot
Locating free positions in LR(k) grammars
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.