Reversible Top-Down Syntax Analysis

DOI10.1142/s012905412244004xOpenAlexW4309466299MaRDI QIDQ6169965

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

closure propertieslookaheadcomputational 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Reversible simulation of one-dimensional irreversible cellular automata
• Reversible top-down syntax analysis
• Real-time reversible iterative arrays
• Reversible computing and cellular automata -- a survey
• Fast reversible language recognition using cellular automata
• Reversible pushdown automata
• Top-down syntax nalysis
• Aspects of Reversibility for Classical Automata
• Reversible and Irreversible Computations of Deterministic Finite-State Devices
• Degrees of Reversibility for DFA and DPDA
• Irreversibility and Heat Generation in the Computing Process
• Inference of Reversible Languages
• Minimal Reversible Deterministic Finite Automata
• Developments in Language Theory
• Real-Time Reversible One-Way Cellular Automata
• Syntax-Directed Transduction
• Properties of deterministic top-down grammars
• Logical Reversibility of Computation

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