An Earley Algorithm for Generic Attribute Augmented Grammars and Applications.
Frédéric Tendeau · International Workshop/Conference on Parsing Technologies · 1997
We describe an extension of Earley’s algorithm which computes the decoration of a shared forest in a generic domain. At tribute computations are defined by a morphism from leftmost derivations to the generic domain, which leaves the computations independent from (even if guided by) the parsing strategy. The approach is illustrated by the example of a definite clause grammar, seen as CF-grammars decorated by attributes.