Grammar analysis and parsing by abstract interpretation

Authors:
Patrick Cousot;Radhia Cousot
Affiliations:
École Normale Supérieure, Paris cedex 05, France;CNRS & École polytechnique, Palaiseau cedex, France
Venue:
Program analysis and compilation, theory and practice
Year:
2007

Citing 8
Cited 3

An incremental algorithm for a generalization of the shortest-path problem

Journal of Algorithms
Contextual grammars and formal languages

Handbook of formal languages, vol. 2
Two Families of Languages Related to ALGOL

Journal of the ACM (JACM)
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
Grammar Flow Analysis

Proceedings on Attribute Grammars, Applications and Systems

The Verification Grand Challenge and Abstract Interpretation

Verified Software: Theories, Tools, Experiments
Abstract interpretation of resolution-based semantics

Theoretical Computer Science
Parsing with derivatives: a functional pearl

Proceedings of the 16th ACM SIGPLAN international conference on Functional programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 problem, classical grammar flow analysis algorithms, and parsing algorithms.