Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars
cmp-lg
2008-02-03 v1 计算与语言
摘要
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.
引用
@article{arxiv.cmp-lg/9407030,
title = {Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars},
author = {Arturo Trujillo},
journal= {arXiv preprint arXiv:cmp-lg/9407030},
year = {2008}
}
备注
6 pages, COLING 94, compressed, uuencoded PostScript, 93KB