Dynamic grammars and semantic analysis

Abstract : We define a dynamic grammar as a device which may generate an unbounded set of context-free grammars, each grammar is produced, while parsing a source text, by the recognition of some construct. It is shown that dynamic grammars have the formal power of Turing machines. For a given source text, a dynamic grammar, when non ambiguous, may be seen as a sequence of usual context-free grammars specialized by this source text: an initial grammar is modified, little by little, while the program is parsed and is used to continue the parsing process. An experimental system which implements a non ambiguous \sl dynamic parser is sketched and applications of this system for the resolution of some semantic analysis problems are shown. Some of these examples are non-trivial (overloading resolution, derived types, polymorphism, \ldots) and indicate that this method may partly compete with other well-known techniques used in type-checking.
Document type :
Reports
Complete list of metadatas

https://hal.inria.fr/inria-00074352
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 3:08:11 PM
Last modification on : Friday, September 16, 2016 - 3:19:38 PM
Long-term archiving on : Sunday, April 4, 2010 - 10:15:49 PM

Identifiers

  • HAL Id : inria-00074352, version 1

Collections

Citation

Pierre Boullier. Dynamic grammars and semantic analysis. [Research Report] RR-2322, INRIA. 1994. ⟨inria-00074352⟩

Share

Metrics

Record views

288

Files downloads

330