On the public citation graph

Top-down syntax analysis

0 signed · 124 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/bf01946814openalex-snapshot

Notes on top-down languages

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)90446-8openalex-snapshot

Properties of deterministic top-down grammars

inferredcites →https://doi.org/10.1016/s0066-4138(61)80003-7openalex-snapshot

A description of mercury autocode in terms of a phrase structure language

inferredcites →https://doi.org/10.1109/pgec.1964.263814openalex-snapshot

The Syntax of Programming Languages-A Survey

inferredcites →https://doi.org/10.1109/swat.1966.22openalex-snapshot

Simple deterministic languages

inferredcites →https://doi.org/10.1109/swat.1970.5openalex-snapshot

Deterministic left corner parsing

inferredcites →https://doi.org/10.1145/321466.321477openalex-snapshot

Syntax-Directed Transduction

inferredcites →https://doi.org/10.1145/357980.357986openalex-snapshot

A syntax directed compiler for ALGOL 60

inferredcites →https://doi.org/10.1145/357980.358005openalex-snapshot

An efficient context-free parsing algorithm

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/366062.366083openalex-snapshot

A syntax directed compiler for ALGOL 60

inferredcites →https://doi.org/10.1145/366663.366704openalex-snapshot

Design of a separable transition-diagram compiler

inferredcites →https://doi.org/10.1145/368959.368992openalex-snapshot

Syntactic analysis by digital computer

inferredcites →https://doi.org/10.1145/800257.808896openalex-snapshot

META II a syntax-oriented compiler writing language

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.4380080107openalex-snapshot

The formal definition of human/ machine communications

inferred← citeshttps://doi.org/10.1002/spe.892openalex-snapshot

A text pattern‐matching tool based on Parsing Expression Grammars

inferred← citeshttps://doi.org/10.1007/3-540-06473-7_44openalex-snapshot

Automatische Indexierung durch linguistische Syntaxanalyse

inferred← citeshttps://doi.org/10.1007/3-540-07141-5_225openalex-snapshot

A Binary Control Structure and its Relationship to Grammars and Side Effects

inferred← citeshttps://doi.org/10.1007/3-540-07141-5_226openalex-snapshot

A Technique for Parsing Ambiguous Languages

inferred← citeshttps://doi.org/10.1007/3-540-07410-4_646openalex-snapshot

Kombination von sackgassenfreier Topdown- und Bottomup-Syntaxanalyse

inferred← citeshttps://doi.org/10.1007/3-540-09526-8_41openalex-snapshot

Validity test for Floyd's operator-precedence parsing algorithms

inferred← citeshttps://doi.org/10.1007/3-540-10245-0openalex-snapshot

Context-free grammars: Covers, normal forms, and parsing

inferred← citeshttps://doi.org/10.1007/3-540-53101-7_1openalex-snapshot

The genesis of attribute grammars

inferred← citeshttps://doi.org/10.1007/3540069585_47openalex-snapshot

LL(1) Grammars and Analysers

inferred← citeshttps://doi.org/10.1007/978-0-387-68954-8openalex-snapshot

Parsing Techniques: A Practical Guide

inferred← citeshttps://doi.org/10.1007/978-1-4471-5514-0_4openalex-snapshot

Pushdown Automata and Parsing

inferred← citeshttps://doi.org/10.1007/978-3-030-04879-2_4openalex-snapshot

Pushdown Automata and Parsing

inferred← citeshttps://doi.org/10.1007/978-3-030-50026-9_24openalex-snapshot

On the Transformation of LL(k)-linear Grammars to LL(1)-linear

inferred← citeshttps://doi.org/10.1007/978-3-030-81508-0_21openalex-snapshot

Reversible Top-Down Syntax Analysis

inferred← citeshttps://doi.org/10.1007/978-3-031-07469-1_10openalex-snapshot

Syntax Checking Either Way

inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_55openalex-snapshot

New Ways to Construct Binary Search Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_21openalex-snapshot

Efficient Construction of Near-Optimal Binary and Multiway Search Trees

inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_12openalex-snapshot

Should Static Search Trees Ever Be Unbalanced?

inferred← citeshttps://doi.org/10.1007/978-3-642-48675-3_6openalex-snapshot

Statistical and Syntactic Models and Pattern Recognition Techniques

inferred← citeshttps://doi.org/10.1007/978-3-642-67081-7_6openalex-snapshot

Kontextfreie Sprachen, Fortsetzung

inferred← citeshttps://doi.org/10.1007/978-3-642-68064-9_6openalex-snapshot

ESPRESO-W, ein Werkzeug für die Spezifikation von Prozeßrechner-Software

inferred← citeshttps://doi.org/10.1007/978-3-642-80732-9_4openalex-snapshot

Methoden der Syntaktischen Analyse bei Formalen Sprachen

inferred← citeshttps://doi.org/10.1007/978-3-642-82158-5_79openalex-snapshot

Konzeption eines Anwendungsgenerators am Beispiel von GENDAS und der Anwendungsbeschreibungssprache FORMULA

inferred← citeshttps://doi.org/10.1007/978-3-642-95289-0_8openalex-snapshot

Top Down Parsing of Macro Grammars

inferred← citeshttps://doi.org/10.1007/978-3-662-02328-0_20openalex-snapshot

Term Reduction Systems and Algebraic Algorithms

inferred← citeshttps://doi.org/10.1007/978-3-662-41148-3_44openalex-snapshot

Automatische Indexierung Durch Linguistische Syntaxanalyse

inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_1openalex-snapshot

Context-Free Ambiguity Detection Using Multi-stack Pushdown Automata

inferred← citeshttps://doi.org/10.1007/bf00264317openalex-snapshot

The ELL(1) parser generator and the error recovery mechanism

inferred← citeshttps://doi.org/10.1007/bf00268320openalex-snapshot

A method for transforming grammars into LL(k) form

inferred← citeshttps://doi.org/10.1007/bf00271339openalex-snapshot

On computing the transitive closure of a relation

inferred← citeshttps://doi.org/10.1007/bf00276181openalex-snapshot

The parsing problem for affix grammars

inferred← citeshttps://doi.org/10.1007/bf01068910openalex-snapshot

Time complexity in the operation of a two-way parser

inferred← citeshttps://doi.org/10.1007/bf01070336openalex-snapshot

Automaton characteristic of methods of syntactic analysis with regular control

inferred← citeshttps://doi.org/10.1007/bf01407953openalex-snapshot

Parallel construction of SLR (1) and LALR (1) parsers

inferred← citeshttps://doi.org/10.1007/bf01744303openalex-snapshot

On comparingLL(k) andLR(k) grammars

inferred← citeshttps://doi.org/10.1007/bf01932269openalex-snapshot

A characterization ofLL(1) grammars

inferred← citeshttps://doi.org/10.1007/bf02239477openalex-snapshot

Generation, recognition and parsing of context-free languages by means of recursive graphs

inferred← citeshttps://doi.org/10.1007/bf02252913openalex-snapshot

Anwendung von Graphenalgorithmen auf allgemeinere Problemklassen

inferred← citeshttps://doi.org/10.1007/bf02943116openalex-snapshot

Reduction of unnecessary dotted rules in the earley-algorithm

inferred← citeshttps://doi.org/10.1007/bfb0030290openalex-snapshot

Outline of an algebraic language theory

inferred← citeshttps://doi.org/10.1007/s00224-022-10108-6openalex-snapshot

On the Transformation of LL(k)-linear to LL(1)-linear Grammars

inferred← citeshttps://doi.org/10.1007/s00236-007-0045-0openalex-snapshot

Recursive descent parsing for Boolean grammars

inferred← citeshttps://doi.org/10.1007/s00236-017-0308-3openalex-snapshot

Fast deterministic parsers for transition networks

inferred← citeshttps://doi.org/10.1007/s10270-012-0266-8openalex-snapshot

Bridging the chasm between MDE and the world of compilation

inferred← citeshttps://doi.org/10.1007/s11004-006-9074-4openalex-snapshot

Simulating Sedimentary Successions Using Syntactic Pattern Recognition Techniques

inferred← citeshttps://doi.org/10.1016/0020-0190(75)90009-5openalex-snapshot

LL-regular grammars

inferred← citeshttps://doi.org/10.1016/0020-0190(75)90035-6openalex-snapshot

LL(1) grammars supporting an efficient error handling

inferred← citeshttps://doi.org/10.1016/0020-0190(78)90077-7openalex-snapshot

Phrase structures, non-determinism and backtracking

inferred← citeshttps://doi.org/10.1016/0020-0190(82)90038-2openalex-snapshot

On the relationship between the LL(k) and LR(k) grammars

inferred← citeshttps://doi.org/10.1016/0020-0255(75)90002-xopenalex-snapshot

Efficient parsing algorithms for general context-free parsers

inferred← citeshttps://doi.org/10.1016/0022-0000(79)90031-xopenalex-snapshot

On LL-regular grammars

inferred← citeshttps://doi.org/10.1016/0022-0000(83)90015-6openalex-snapshot

On the complexity of LL(k) testing

inferred← citeshttps://doi.org/10.1016/0022-0000(86)90061-9openalex-snapshot

A representation theorem of infinite dimensional algebras and applications to language theory

inferred← citeshttps://doi.org/10.1016/0066-4138(73)90002-5openalex-snapshot

Incremental compilation and conversational interpretation

inferred← citeshttps://doi.org/10.1016/0304-3975(79)90032-xopenalex-snapshot

Simple chain grammars and languages

inferred← citeshttps://doi.org/10.1016/b978-0-12-708240-0.50006-xopenalex-snapshot

Context-Free Multilanguages

inferred← citeshttps://doi.org/10.1016/j.amc.2007.02.052openalex-snapshot

A new genetic approach to construct near-optimal binary search trees

inferred← citeshttps://doi.org/10.1016/j.ejor.2008.06.017openalex-snapshot

Allocating the fixed cost as a complement of other cost inputs: A DEA approach

inferred← citeshttps://doi.org/10.1016/j.ipl.2005.03.014openalex-snapshot

Restructuring binary search trees revisited

inferred← citeshttps://doi.org/10.1016/j.isprsjprs.2010.10.001openalex-snapshot

Learning grammar rules of building parts from precise models and noisy observations

inferred← citeshttps://doi.org/10.1016/j.scico.2014.01.012openalex-snapshot

On the relation between context-free grammars and parsing expression grammars

inferred← citeshttps://doi.org/10.1016/j.scico.2016.04.003openalex-snapshot

Structuring the GLL parsing algorithm for performance

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.12.028openalex-snapshot

Streaming algorithms for language recognition problems

inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114000openalex-snapshot

Syntax checking either way

inferred← citeshttps://doi.org/10.1016/j.tcs.2026.115936openalex-snapshot

LL(k) cooperating distributed grammar systems

inferred← citeshttps://doi.org/10.1016/s0019-9958(70)90224-xopenalex-snapshot

The parsing for general phrase-structure grammars

inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90362-0openalex-snapshot

Parsing macro grammars top down

inferred← citeshttps://doi.org/10.1016/s0019-9958(82)91016-6openalex-snapshot

On LL(k) parsing

inferred← citeshttps://doi.org/10.1016/s0020-7373(79)80028-0openalex-snapshot

A top-down language analyzer

inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73493-5openalex-snapshot

Character Strings as Directed Euler Paths

inferred← citeshttps://doi.org/10.1016/s1474-6670(17)61614-8openalex-snapshot

Interactive Real-time Software in Advanced Robotics

inferred← citeshttps://doi.org/10.1017/s0956796812000329openalex-snapshot

When Maybe is not good enough

inferred← citeshttps://doi.org/10.1061/(asce)su.1943-5428.0000232openalex-snapshot

Semantically Enhanced 3D Building Model Reconstruction from Terrestrial Laser-Scanning Data

inferred← citeshttps://doi.org/10.1080/00207167208803062openalex-snapshot

Book Reviews

inferred← citeshttps://doi.org/10.1080/19475680903464696openalex-snapshot

Integration of conditional random fields and attribute grammars for range data interpretation of man-made objects

inferred← citeshttps://doi.org/10.1093/comjnl/21.2.144openalex-snapshot

Compiler Writing System for Attribute Grammars

inferred← citeshttps://doi.org/10.1093/nar/10.1.69openalex-snapshot

Formal description of a DNA oriented computer language

inferred← citeshttps://doi.org/10.1109/discex.2000.824975openalex-snapshot

The Horus and Ensemble projects: accomplishments and limitations

inferred← citeshttps://doi.org/10.1109/mc.1980.1653739openalex-snapshot

Translator Writing Systems: Where Do they Now Stand?

inferred← citeshttps://doi.org/10.1109/tse.1979.234208openalex-snapshot

Evaluating and Improving Recursive Descent Parsers

inferred← citeshttps://doi.org/10.1111/tgis.12200openalex-snapshot

Statistical Relational Learning of Grammar Rules for 3D Building Reconstruction

inferred← citeshttps://doi.org/10.1134/s0361768816010047openalex-snapshot

About performance and intellectuality of supercomputer modeling

inferred← citeshttps://doi.org/10.1137/s0097539701400154openalex-snapshot

A Powerful LL( k ) Covering Transformation

inferred← citeshttps://doi.org/10.1142/s012905412244004xopenalex-snapshot

Reversible Top-Down Syntax Analysis

inferred← citeshttps://doi.org/10.1145/1408681.1408683openalex-snapshot

A parsing machine for PEGs

inferred← citeshttps://doi.org/10.1145/3237009.3237023openalex-snapshot

Utilizing object reference graphs and garbage collection roots to detect memory leaks in offline memory monitoring

inferred← citeshttps://doi.org/10.1145/3264637.3264646openalex-snapshot

Towards certified virtual machine-based regular expression parsing

inferred← citeshttps://doi.org/10.1145/3387168.3387216openalex-snapshot

Just-in-time Parsing with Scannerless Earley Virtual Machines

inferred← citeshttps://doi.org/10.1145/3486608.3486900openalex-snapshot

Fast incremental PEG parsing

inferred← citeshttps://doi.org/10.1145/356628.356629openalex-snapshot

LR Parsing

inferred← citeshttps://doi.org/10.1145/359511.359517openalex-snapshot

Analyses of deterministic parsing algorithms

inferred← citeshttps://doi.org/10.1145/360933.360969openalex-snapshot

Deterministic parsing of ambiguous grammars

inferred← citeshttps://doi.org/10.1145/3624309.3624317openalex-snapshot

A Verified Operational Semantics for Regular Expression Parsing

inferred← citeshttps://doi.org/10.1145/382137.382139openalex-snapshot

MPACT

inferred← citeshttps://doi.org/10.1145/512927.512928openalex-snapshot

Deterministic parsing of ambiguous grammars

inferred← citeshttps://doi.org/10.1145/800238.807142openalex-snapshot

LL versus LR parsing with illustrations from ALGOL 68

inferred← citeshttps://doi.org/10.1145/872738.807142openalex-snapshot

LL versus LR parsing with illustrations from ALGOL 68

inferred← citeshttps://doi.org/10.1145/956015.956017openalex-snapshot

A translation machine with automated top-down parsing

inferred← citeshttps://doi.org/10.1145/986953.986957openalex-snapshot

Compiler generation for attribute grammars

inferred← citeshttps://doi.org/10.1201/9780203869352-8openalex-snapshot

Attribute grammar for 3D city models

inferred← citeshttps://doi.org/10.1201/9780203869352.ch5openalex-snapshot

Attribute grammar for 3D city models

inferred← citeshttps://doi.org/10.15439/2017f162openalex-snapshot

Parsing with Earley Virtual Machines

inferred← citeshttps://doi.org/10.2307/3679756openalex-snapshot

Grammars as Representations for Music

inferred← citeshttps://doi.org/10.3384/ecp12076809openalex-snapshot

Modelica Code Generation with Polymorphic Arrays and Records Used in Wind Turbine Modeling

inferred← citeshttps://doi.org/10.37811/cl_rcm.v7i6.9324openalex-snapshot

Aplicación del Internet de las Cosas en Ambientes Industriales para el Monitoreo de Plantas de Tratamiento de Aguas Residuales

inferred← citeshttps://doi.org/10.48550/arxiv.2010.07874openalex-snapshot

The LL(finite) strategy for optimal LL(k) parsing

inferred← citeshttps://doi.org/10.5194/isprs-annals-iii-3-311-2016openalex-snapshot

INCREMENTAL REFINEMENT OF FAÇADE MODELS WITH ATTRIBUTE GRAMMAR FROM 3D POINT CLOUDS

inferred← citeshttps://doi.org/10.5555/800099.803202openalex-snapshot

The design of a reliable applications system

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.