Context-free adaptive grammars with appearance checking. / Gramáticas livres de contexto adaptativas com verificação de aparência.

AUTOR(ES)
DATA DE PUBLICAÇÃO

2004

RESUMO

This work introduces and describes the formalism of the context-free adaptive grammar with appearance checking. Such gramatical devices have as its kernel a subjacent context-free grammar and, as mechanism of self-modification, one or several adaptive functions which determines the productions able to be applied at each step of a derivation. The appearance checking refers to a special way to apply some productions, choosen by the designer of the grammar, without changing the sentential form in this application. It is proved that this formalism has Turing Machine power, proving, by construction, its equivalence with four grammatical formalisms based on context-free grammars and with control mechanisms, with such power. Two parsers have been developed for context-dependent languages from one of these four formalisms. One of them is based on stack-automata, and operates in a bottom-up fashion.

ASSUNTO(S)

regulated rewriting in formal language theory grammars with controled derivations adaptive grammars reescritura controlada em teoria de linguagens formais autômatos daptativos gramáticas adaptativas gramáticas com derivações controladas adaptive automata

Documentos Relacionados