Decompiling context-free languages from their Polish-like representations
From MaRDI portal
Publication:1163872
DOI10.1007/BF02576191zbMath0484.68069OpenAlexW2057618659MaRDI QIDQ1163872
Publication date: 1982
Published in: Calcolo (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02576191
algorithmscompilationdecompilationleft-to-right and right-to-left processingPolish representationunique inversion of the representation
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Decompiling context-free languages from their Polish-like representations
- Structural equivalence of context-free grammars
- Syntax directed translations and the pushdown assembler
- More on the re-creation of source code from reverse polish
- Translation grammars for compilation and decompilation
- Re‐creation of source code from reverse polish form
This page was built for publication: Decompiling context-free languages from their Polish-like representations