Grammar semantics, analysis and parsing by abstract interpretation

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 l...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Theoretical computer science Ročník 412; číslo 44; s. 6135 - 6192
Hlavní autoři:	Cousot, Patrick, Cousot, Radhia
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier B.V 14.10.2011 Elsevier
Témata:	Abstract interpretation Abstract semantics Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Automation Bottom-up semantics Computer science; control theory; systems Context-free grammar Derivation Exact sciences and technology Grammar flow analysis Grammar problem Grammars Hierarchies Language theory and syntactical analysis Logic and foundations Mathematical logic, foundations, set theory Mathematics Miscellaneous Parsing Parsing algorithms Recursion theory Refining Sciences and techniques of general use Semantics Theoretical computing Top-down semantics Top-down semantics Grammar problem Parsing Context-free grammar Bottom-up semantics Grammar flow analysis Abstract interpretation Abstract semantics Automaton Computer theory Semantic analysis Flow Context free grammar Algorithm analysis
ISSN:	0304-3975, 1879-2294
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!