Implementing start conditions

Chris Nokleberg <chrishdp@uclink.berkeley.edu>
18 Jun 1998 11:18:41 -0400

          From comp.compilers
Related articles
Implementing start conditions chrishdp@uclink.berkeley.edu (Chris Nokleberg) (1998-06-18)
Re: Implementing start conditions janaki@csa.iisc.ernet.in (Janaki S) (1998-06-19)
| List of all articles for this month |
From: Chris Nokleberg <chrishdp@uclink.berkeley.edu>
Newsgroups: comp.compilers
Date: 18 Jun 1998 11:18:41 -0400
Organization: Compilers Central
Keywords: lex

I'm writing a flex-ish tool for Java (one that will handle unicode,
lookahead, and some other things I haven't been able to find).


Right now I'm working on start conditions. I think there are two
options--using separate DFAs for each exclusive start condition, or
combining everything into one huge DFA and using some trickyness when
matching. What are the pros and cons of going either way? Would using
separate DFAs speed things up enough to be worth it?


Thanks,
Chris
--

Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.