Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars

Details Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars

1994-07-30

arxiv.org/abs/cmp-lg/9407030v1

Computer Science

Computation and Language

6 pages, COLING 94, compressed, uuencoded PostScript, 93KB

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-132364