A method for automatic program inversion based on LR(0) parsing
From MaRDI portal
Recommendations
Cited in
(18)- Determinization of conditional term rewriting systems
- Determinization of inverted grammar programs via context-free expressions
- Constructing a binary tree from its traversals by reversible recursion and iteration
- Reversible computing from a programming language perspective
- A theoretical approach to program inversion
- Improving determinization of grammar programs for program inversion
- Synthesizing loops for program inversion
- A grammar-based approach to invertible programs
- Automatic Partial Inversion of Inductively Sequential Functions
- Semi-inversion of conditional constructor term rewriting systems
- Completion after program inversion of injective functions
- Characterizing Compatible View Updates in Syntactic Bidirectionalization
- Inverse Unfold Problem and Its Heuristic Solving
- Functional and Logic Programming
- FliPpr: a prettier invertible printing system
- A program inverter for a functional language with equality and constructors.
- Tail recursion transformation for invertible functions
- Towards a dereversibilizer: fewer asserts, statically
This page was built for publication: A method for automatic program inversion based on LR(0) parsing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5472880)
