@inproceedings{tendeau-1997-earley,
    title = "An {E}arley Algorithm for Generic Attribute Augmented Grammars and Applications",
    author = "Tendeau, Frederic",
    editor = "Nijholt, Anton  and
      Berwick, Robert C.  and
      Bunt, Harry C.  and
      Carpenter, Bob  and
      Hajicova, Eva  and
      Johnson, Mark  and
      Joshi, Aravind  and
      Kaplan, Ronald  and
      Kay, Martin  and
      Lang, Bernard  and
      Lavie, Alon  and
      Nagao, Makoto  and
      Steedman, Mark  and
      Tomita, Masaru  and
      Vijay-Shanker, K.  and
      Weir, David  and
      Wittenburg, Kent  and
      Wiren, Mats",
    booktitle = "Proceedings of the Fifth International Workshop on Parsing Technologies",
    month = sep # " 17-20",
    year = "1997",
    address = "Boston/Cambridge, Massachusetts, USA",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/jlcl-multiple-ingestion/1997.iwpt-1.23/",
    pages = "199--209",
    abstract = "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."
}