Open Access
Dynamic grammars and semantic analysis
Reads0
Chats0
TLDR
It is shown that dynamic grammars have the formal power of Turing machines and 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.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.read more
Citations
More filters
Um Levantamento da Evolução da Adaptatividade e da Tecnologia Adaptativa
TL;DR: In this article, an artigo levanta uma parcela significativa da litera-tura publicada em torno da adapta tividade e de assuntos associa-dos.
Journal ArticleDOI
Efficient formalism-only parsing of XML/HTML using the §-calculus
TL;DR: A grammar-only (HT\X)ML parser which, upon detecting that it is parsing XML, modifies itself dynamically in order to insure that the document conforms to XML'S stricter rules.
Journal ArticleDOI
The formalization and implementation of Adaptable Parsing Expression Grammars
Leonardo V. S. Reis,Roberto da Silva Bigonha,Vladimir Oliveira Di Iorio,Luis Eduardo de Souza Amorim +3 more
TL;DR: The design and formal definition of Adaptable Parsing Expression Grammars are presented, an extension to the PEG model that allows the manipulation of its own production rules during the analysis of an input string and initial performance tests suggest that the model may work well in practice.
Book ChapterDOI
Adaptable parsing expression grammars
Leonardo V. S. Reis,Roberto da Silva Bigonha,Vladimir Oliveira Di Iorio,Luis Eduardo de Souza Amorim +3 more
TL;DR: This paper presents the design and formal definition for Adaptable Parsing Expression Grammars (APEG), an extension to the PEG model that allows the manipulation of its own production rules during the analysis of an input string and shows that the proposed model may compare favorably with similar approaches for the definition of the syntax of extensible languages.
Adaptive Predicates in Natural Language Parsing
TL;DR: This work introduces one element of the authors' §-Calculus (meta-S) sextuple, the terminal qualifier, which, when used in conjunction with the §- Calculus’ adaptive properties, facilitates not only the expression of disambiguating grammar rules, but also, through the side-effect of modification of the sets of the grammar, allows subsequences of input to disambiguous themselves self-referentially.