Reversible Top-Down Syntax Analysis

DOI10.1142/S012905412244004XMaRDI QIDQ6169965zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Uwe Meyer

Publication date 15 August 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s012905412244004x

zbMATH Keywords

lookaheadclosure propertiescomputational capacityanti abstract family of languagesreversible computationsstateless pushdown automata\(\mathrm{LL}(k)\) languagestop-down syntax analysis

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Recommendations

• Reversible top-down syntax analysis
• scientific article; zbMATH DE number 2050923
• scientific article; zbMATH DE number 496063
• INFERENCE OF REVERSIBLE LANGUAGES
• Reversible term rewriting
• Run-time extensible deterministic top-down parsing
• Towards a reversible functional language
• Bottom-Up Rewriting Is Inverse Recognizability Preserving
• Semantics-to-Syntax Analyses of Algorithms
• Reversible Flowchart Languages and the Structured Reversible Program Theorem

Cites work

• scientific article; zbMATH DE number 3856438 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• Aspects of reversibility for classical automata
• Degrees of reversibility for DFA and DPDA
• Developments in Language Theory
• Fast reversible language recognition using cellular automata
• Inference of Reversible Languages
• Irreversibility and Heat Generation in the Computing Process
• Logical Reversibility of Computation
• Minimal reversible deterministic finite automata
• Properties of deterministic top-down grammars
• Real-time reversible iterative arrays
• Real-time reversible one-way cellular automata
• Reversible and irreversible computations of deterministic finite-state devices
• Reversible computing and cellular automata -- a survey
• Reversible pushdown automata
• Reversible simulation of one-dimensional irreversible cellular automata
• Reversible top-down syntax analysis
• Syntax-Directed Transduction
• Top-down syntax nalysis

Cited in

(1)

• Modelling reliability of reversible circuits with 2D second-order cellular automata

This page was built for publication: Reversible Top-Down Syntax Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169965)