On the public citation graph

Directly-Executable Earley Parsing

https://doi.org/10.1007/3-540-45306-7_16
0 signed · 35 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.1002/(sici)1097-024x(199802)28:2<181::aid-spe139>3.0.co;2-4openalex-snapshot
Very fast YACC-compatible parsers (for very little effort)
inferredcites →https://doi.org/10.1002/spe.4380110908openalex-snapshot
Interpretation Techniques
inferredcites →https://doi.org/10.1002/spe.4380200602openalex-snapshot
Even faster lr parsing
inferredcites →https://doi.org/10.1007/3-540-06841-4_65openalex-snapshot
Deterministic Techniques for Efficient Non-Deterministic Parsers
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/3-540-53669-8_82openalex-snapshot
Optimizing directly executable LR parsers
inferredcites →https://doi.org/10.1007/3-540-61053-7_68openalex-snapshot
A faster Earley parser
inferredcites →https://doi.org/10.1007/978-0-387-68954-8openalex-snapshot
Parsing Techniques: A Practical Guide
inferredcites →https://doi.org/10.1007/978-1-4615-3186-9openalex-snapshot
The Functional Treatment of Parsing
inferredcites →https://doi.org/10.1007/bfb0031377openalex-snapshot
Construction of efficient generalized LR parsers
inferredcites →https://doi.org/10.1016/0020-0190(92)90260-3openalex-snapshot
A recursive ascent Earley parser
inferredcites →https://doi.org/10.1016/0020-0255(75)90002-xopenalex-snapshot
Efficient parsing algorithms for general context-free parsers
inferredcites →https://doi.org/10.1016/0096-0551(88)90010-0openalex-snapshot
SL parses the LR languages
inferredcites →https://doi.org/10.1016/0304-3975(92)90127-2openalex-snapshot
Recursive ascent parsing: from Earley to Marcus
inferredcites →https://doi.org/10.1109/iccl.1994.288376openalex-snapshot
Efficient incremental parsing for context-free languages
inferredcites →https://doi.org/10.1109/wpc.1998.693325openalex-snapshot
Current parsing techniques in software renovation considered harmful
inferredcites →https://doi.org/10.1145/12276.13326openalex-snapshot
Very fast LR parsing
inferredcites →https://doi.org/10.1145/357980.358005openalex-snapshot
An efficient context-free parsing algorithm
inferredcites →https://doi.org/10.1145/362248.362270openalex-snapshot
Threaded code
inferredcites →https://doi.org/10.3115/981623.981641openalex-snapshot
The structure of shared forests in ambiguous parsing

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.3830636openalex-extracted
Learnability in the Context of Lexicalized Parameters: A Compositional Approach to Language Acquisition
inferred← citeshttps://doi.org/10.1007/3-540-45937-5_12openalex-snapshot
Disambiguation Filters for Scannerless Generalized LR Parsers
inferred← citeshttps://doi.org/10.1007/978-3-540-85110-3_34openalex-snapshot
Authoring Verified Documents by Interactive Proof Construction and Verification in Text-Editors
inferred← citeshttps://doi.org/10.1007/s00236-014-0201-2openalex-snapshot
On the incremental growth and shrinkage of LR goto-graphs
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82629-5openalex-snapshot
Generalized Parsing and Term Rewriting: Semantics Driven Disambiguation
inferred← citeshttps://doi.org/10.1093/comjnl/45.6.620openalex-snapshot
Practical Earley Parsing
inferred← citeshttps://doi.org/10.1109/ict4da62874.2024.10777123openalex-snapshot
Designing an Automatic Sentence based Parsing for Ge’ez Sentences
inferred← citeshttps://doi.org/10.1145/1988783.1988793openalex-snapshot
Parsing reflective grammars
inferred← citeshttps://doi.org/10.1145/969637.969640openalex-snapshot
Why bison is becoming extinct
inferred← citeshttps://doi.org/10.13053/rcs-117-1-2openalex-snapshot
A Modified Earley Parser for Huge Natural Language Grammars
inferred← citeshttps://doi.org/10.15439/2017f162openalex-snapshot
Parsing with Earley Virtual Machines
inferred← citeshttps://doi.org/10.22028/d291-26394openalex-snapshot
Assertion level proof planning with compiled strategies
inferred← citeshttps://doi.org/10.2498/cit.2002.01.04openalex-snapshot
The Design and Implementation of SPARK, a Toolkit for Implementing Domain-Specific Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1102.2003openalex-snapshot
Parsing Reflective Grammars
inferred← citeshttps://doi.org/10.70675/bd48f7ebz9c21z4ac6z9970z7725b0a53beaopenalex-snapshot
Efficient finite-state algorithms for the application of local 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.