Document Type

Other

Publication Date

1-1999

Abstract

This paper presents the Recursive Adaptable Grammar (RAG) formalism. RAGs allow arbitrary Turing-powerful language analysis to be described entirely in terms of a single level of "context-free" derivation. RAGs superficially resemble a limited form of Extended Attribute Grammars (EAGs); but while the EAG derivation step relation may entail arbitrary subsidiary computations, the normal RAG derivation step relation is elementary. The RAG formalism is introduced and defined; basic properties of the formalism are shown; and a well-behavedness property called strong answer-encapsulation is developed.

DOI

WPI-CS-TR-99-03

Share

 
COinS