Syntactic Analysis and Operator Precedence
From MaRDI portal
Publication:5343340
DOI10.1145/321172.321179zbMATH Open0133.25504DBLPjournals/jacm/Floyd63OpenAlexW2097033551WikidataQ56573511 ScholiaQ56573511MaRDI QIDQ5343340FDOQ5343340
Authors: Robert W. Floyd
Publication date: 1963
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321172.321179
Cited In (41)
- Weighted operator precedence languages
- Inference for regular bilanguages
- Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
- A basic course on compiler principles
- Model-checking structured context-free languages
- Ambiguity and precedence in syntax description
- Title not available (Why is that?)
- Correctness of an extended operator-precedence parsing algorithm
- Complete operator precedence
- Hardest languages for conjunctive and Boolean grammars
- Verification of programs with exceptions through operator precedence automata
- Error detection in precedence parsers
- Linear precedence functions for weak precedence grammars
- PHRASE parsers from multi-axiom grammars
- Refunctionalization at work
- Toward a theory of input-driven locally parsable languages
- Operator precedence temporal logic and model checking
- LR-regular grammars - an extension of LR(k) grammars
- Nonterminal separation in graph grammars
- The size of LALR (1) parsers
- A note on weak operator precedence grammars
- A note on weak operator precedence grammars
- Operator precedence and the visibly pushdown property
- Locally chain-parsable languages
- Weighted operator precedence languages
- A note on top-down deterministic languages
- Beyond operator-precedence grammars and languages
- A method for the structural analysis of two-dimensional mathematical expressions
- Construction of recognition devices for regular languages from their Backus Normal Form definition
- Operator Precedence Languages: Their Automata-Theoretic and Logic Characterization
- Un programma per semplificare espressioni algebriche razionali
- A graph theory oriented extension to ALGOL
- Invito alla teoria dei linguaggi formali
- Antichains algorithms for the inclusion problem between \(\omega\)-VPL
- Title not available (Why is that?)
- Generalizing input-driven languages: theoretical and practical benefits
- Precedence automata and languages
- On the pre-AFL of \([lg\;n]\) space and related families of languages
- Precedences in specifications and implementations of programming languages
- Higher-order operator precedence languages
- Double Greibach operator grammars
This page was built for publication: Syntactic Analysis and Operator Precedence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5343340)