On the public citation graph
Parsing extended LR(k) grammars
0 signed · 37 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/bf00263764openalex-snapshot
Eliminating unit productions from LR parsers
inferredcites →https://doi.org/10.1007/bf00264023openalex-snapshot
On the definition of ELR(k) and ELL(k) grammars
inferredcites →https://doi.org/10.1007/bf00264024openalex-snapshot
Constructing LR parsers for regular right part grammars
inferredcites →https://doi.org/10.1007/bf00265221openalex-snapshot
LR-parsing of extended context free grammars
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/0202010openalex-snapshot
A Technique for Speeding up ${\text{LR}}(k)$ Parsers
inferredcites →https://doi.org/10.1145/357980.358005openalex-snapshot
An efficient context-free parsing algorithm
inferredcites →https://doi.org/10.1145/359842.359853openalex-snapshot
Regular right part grammars and their parsers
inferredcites →https://doi.org/10.2307/2005728openalex-snapshot
Systematic Programming: An Introduction
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-3-319-12027-0_1openalex-snapshot
A Parsing Approach to SAT
inferred← citeshttps://doi.org/10.1007/978-3-319-71734-0_3openalex-snapshot
Extended Context-Free Grammars Parsing with Generalized LL
inferred← citeshttps://doi.org/10.1007/978-3-642-00982-2_35openalex-snapshot
Towards a Taxonomy for ECFG and RRPG 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/bf00289138openalex-snapshot
LALR(1, 1) parser generation for regular right part grammars
inferred← citeshttps://doi.org/10.1007/bf00289494openalex-snapshot
An efficient ELL(1)-parser generator
inferred← citeshttps://doi.org/10.1007/bf00289495openalex-snapshot
Generation of efficient LALR parsers for regular right part grammars
inferred← citeshttps://doi.org/10.1007/pl00013318openalex-snapshot
Yet another generation of LALR parsers for regular right part grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90104-9openalex-snapshot
A simple realization of LR-parsers for regular right part grammars
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90235-2openalex-snapshot
An improved LALR(k) parser generation for regular right part grammars
inferred← citeshttps://doi.org/10.1016/j.cola.2021.101035openalex-snapshot
Fast GLR parsers for extended BNF grammars and transition networks
inferred← citeshttps://doi.org/10.1016/s0020-0190(97)00152-xopenalex-snapshot
Characterization of extended LR(k) grammars
inferred← citeshttps://doi.org/10.1080/00207169708804571openalex-snapshot
Lookahead lr parsing with regular right part grammars
inferred← citeshttps://doi.org/10.1145/1017074.1017097openalex-snapshot
Checking potential validity of XML documents
inferred← citeshttps://doi.org/10.1145/1147954.1147959openalex-snapshot
Probabilistic parsing strategies
inferred← citeshttps://doi.org/10.1162/089120100561610openalex-snapshot
Practical Experiments with Regular Approximation of Context-Free Languages
inferred← citeshttps://doi.org/10.18653/v1/2023.acl-long.204openalex-snapshot
Efficient Semiring-Weighted Earley Parsing
inferred← citeshttps://doi.org/10.3115/1218955.1219024openalex-snapshot
Probabilistic parsing strategies
inferred← citeshttps://doi.org/10.3115/977180.977192openalex-snapshot
Non-deterministic recursive ascent parsing
inferred← citeshttps://doi.org/10.3115/981732.981749openalex-snapshot
An optimal tabular parsing algorithm
inferred← citeshttps://doi.org/10.3115/981732.981761openalex-snapshot
An extended theory of head-driven parsing
inferred← citeshttps://doi.org/10.3115/992730.992752openalex-snapshot
Parsing schemata for grammars with variable number and order of constituents
inferred← citeshttps://doi.org/10.48550/arxiv.cs/9910022openalex-snapshot
Practical experiments with regular approximation of context-free languages
inferred← citeshttps://doi.org/10.5715/jnlp.10.5_3openalex-snapshot
A Method of LR Table Compaction for Natural Language Processing.
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.