7 Mar 2000 01:03:47 -0500

Related articles |
---|

Computing FIRST(X) for a left recursive grammar muzzetta@videobank.it (2000-03-06) |

Re: Computing FIRST(X) for a left recursive grammar vugluskr@unicorn.math.spbu.ru (2000-03-06) |

Re: Computing FIRST(X) for a left recursive grammar torbenm@diku.dk (2000-03-06) |

Re: Computing FIRST(X) for a left recursive grammar joachim.durchholz@halstenbach.com.or.de (Joachim Durchholz) (2000-03-06) |

Re: Computing FIRST(X) for a left recursive grammar rsherry@home.com (Robert Sherry) (2000-03-07) |

Re: Computing FIRST(X) for a left recursive grammar johnmce@texas.net (2000-03-07) |

From: | johnmce@texas.net (John McEnerney) |

Newsgroups: | comp.compilers |

Date: | 7 Mar 2000 01:03:47 -0500 |

Organization: | Giganews.Com - Premium News Outsourcing |

References: | 00-03-029 00-03-048 |

Keywords: | parse, LALR |

torbenm@diku.dk (Torben AEgidius Mogensen) wrote:

*> You don't want to use sets of strings, you want to use sets of tokens.*

*> Give each token a number and use bit-vectors. This makes all the set*

*> operations very fast.*

If you frequently iterate over all members currently contained in a set,

you might want to use a sparse set representation a la Briggs' thesis. It

uses more memory, but it's a handy way to avoid some average-case O(N^2)

behavior as the size of the universe grows.

--

John McEnerney (johnmce@texas.net)

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.