Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
An incremental algorithm for a generalization of the shortest-path problem
Journal of Algorithms
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
Contextual grammars and formal languages
Handbook of formal languages, vol. 2
Two Families of Languages Related to ALGOL
Journal of the ACM (JACM)
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Marcus Contextual Grammars
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation
Theoretical Computer Science
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Proceedings on Attribute Grammars, Applications and Systems
From the stack principle to ALGOL
Software pioneers
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The European side of the last phase of the development of ALGOL 60
History of programming languages I
Application of pushdown-store machines
AFIPS '63 (Fall) Proceedings of the November 12-14, 1963, fall joint computer conference
Abstract interpretation of resolution-based semantics
Theoretical Computer Science
Coinductive big-step operational semantics
ESOP'06 Proceedings of the 15th European conference on Programming Languages and Systems
Formal verification by abstract interpretation
NFM'12 Proceedings of the 4th international conference on NASA Formal Methods
Hi-index | 5.23 |
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithms and parsing algorithms.