Decompiling context-free languages from their Polish-like representations
CALCOLOPublished 1 March 1982
Michel Bert, L. Petrone
Citations4
SJR quartileQ2
SJR score0.66
SNIP0.98
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A general definition of Polish representation is given for the class of context-free languages and the conditions allowing unique inversion of the representation are studied.
Abstract
A general definition of Polish representation is given for the class of context-free languages and the conditions allowing unique inversion of the representation are studied. Two algorithms are presented for decompiling an important subclass of Polish representations. Both left-to-right and right-to-left processing is considered.
Keywords
Computer ScienceBiochemistry, Genetics and Molecular Biology
The Theory of Parsing, Translation, and Compiling
1,411 Citations1972Alfred V. Aho, Jeffrey D. Ullman
It is the hope that the algorithms and concepts presented in this book will survive the next generation of computers and programming languages, and that at least some of them will be applicable to fields other than compiler writing.
Journal of Computer and System SciencesSyntax directed translations and the pushdown assembler
167 Citations1969Alfred V. Aho, Jeffrey D. Ullman
It is shown that there exists an infinite hierarchy of syntax-directed translations according to the number of nonterminals allowed on the right side of productions of the underlying context-free grammar.
Journal of Computer and System SciencesStructural equivalence of context-free grammars
50 Citations1968Marvin C. Paull, Stephen H. Unger
It is shown here that there exists a finite algorithm for determining if two arbitrary context-free grammars are structurally equivalent.
A methodology for machine language decompilation
14 Citations1974Barron C. Housel, M. H. Halstead
A general methodology for decompilation that is independent of a particular source and target language is presented and an experimental decompiler was implemented to translate Knuth's MIXAL assembly language into PL/1.
Syntax directed mappings of context Free languages
11 Citations1968L. Petrone
The behavior of contextfree languages is studied in relation to the defined class of mappings and it is shown that the translation can be implemented in two passes: first by a nondeterministic push down automaton and then by a two-way deterministic push up automaton.
Software Practice and ExperienceRe‐creation of source code from reverse polish form
7 Citations1972Peter J. Brown
By adding redundant operators when compiling into reverse Polish notation, it is possible to re‐create source code in exactly its original form, useful for incremental compilers since it permits partial compilation without the need to maintain a copy of the original program.
Software Practice and ExperienceMore on the re‐creation of source code from reverse polish
5 Citations1977Peter J. Brown
A new algorithm, offering good generality and conciseness, is presented for re‐creation of BASIC and other interactive, incremental languages.
Software Practice and ExperienceA note on recreating source code from the reverse polish form
5 Citations1973Colin Charlton, Peter Hibbard
Algorithms are presented which recreate infix form from reverse Polish form of algebraic expressions and the use of these algorithms in incremental compilers is discussed.
BIT Numerical MathematicsTranslation grammars for compilation and decompilation
5 Citations1974Victor Schneider, Gary Winiger
A notation is presented for specifying the compilation and decompilation of high-level language programs to study certain properties of that language, such as the redundancy of source language constructs that yield identical object code sequences and the ambiguity of object code generated by procedure calls.