Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars
<|reference_start|>Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars: 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.<|reference_end|>
@article{trujillo1994computing,
    title={Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars},
    author={Arturo Trujillo (Computer Laboratory, University of Cambridge)},
    journal={arXiv preprint arXiv:cmp-lg/9407030},
    year={1994},
    archivePrefix={arXiv},
    eprint={cmp-lg/9407030},
    primaryClass={cmp-lg cs.CL}
}