Parsing as abstract interpretation of grammar semantics

DOI10.1016/S0304-3975(02)00034-8zbMath1019.68048MaRDI QIDQ1853600

Radhia Cousot, Patrick Cousot

Publication date: 21 January 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

context-free grammarsparsing algorithm

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Grammars and rewriting systems (68Q42)

Related Items (1)

Context-sensitive analysis without calling-context

Cites Work

• ``A la Burstall intermittent assertions induction principles for proving inevitability properties of programs
• Constructive versions of Tarski's fixed point theorems
• A lattice-theoretical fixpoint theorem and its applications
• Temporal abstract interpretation
• Systematic design of program transformation frameworks by abstract interpretation
• An efficient context-free parsing algorithm
• On the translation of languages from left to right

This page was built for publication: Parsing as abstract interpretation of grammar semantics