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-upor top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithms and parsing algorithms.
Original language | English (US) |
---|---|
Pages (from-to) | 6135-6192 |
Number of pages | 58 |
Journal | Theoretical Computer Science |
Volume | 412 |
Issue number | 44 |
DOIs | |
State | Published - Oct 14 2011 |
Keywords
- Abstract interpretation
- Abstract semantics
- Bottom-up semantics
- Context-free grammar
- Grammar flow analysis
- Grammar problem
- Parsing
- Top-down semantics
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science