Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much information from the grammars as possible, using negative restriction to define equivalence classes. Addition of a simple data structure leads to an order of magnitude improvement in execution time over a naive implementation.
6 pages, COLING 94, compressed, uuencoded PostScript, 93KB

Keywords

Computation and Language

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/151041

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cmp-lg/9407030
 http://arxiv.org/abs/cmp-lg/9407030

Collections

arXiv