... finite set of string categories; T a finite set of terminal symbols; P a finite set of productions or rewriting rules of the form X ~t~, Xe N, ae (NUT)*; and S a distinguished symbol of N. A ... ambiguous or, equivalently, if it has cycles Or derivations of the form A~+A, for some A~ N. Consider, for example, the following grammar, which ,measures" the length of each derivation of ... domains and functions (Correa, forthcoming), and the more general nature of attribute grammars in this regard, it is of interest to investigate the extension of Earley's algorithm directly to...