Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars
| dc.creator | Trujillo, Arturo | |
| dc.date | 1994-07-30 | |
| dc.date.accessioned | 2026-07-07T09:09:26Z | |
| dc.date.available | 2026-07-07T09:09:26Z | |
| dc.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. | |
| dc.description | 6 pages, COLING 94, compressed, uuencoded PostScript, 93KB | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9407030 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9407030 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151041 | |
| dc.subject | Computation and Language | |
| dc.title | Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars | |
| dc.type | text |