Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| FIRST_k, FOLLOW_k, k>1 borucki.andrzej@gmail.com (Andy) (2020-02-06) |
| Re: FIRST_k, FOLLOW_k, k>1 borucki.andrzej@gmail.com (Andy) (2020-02-06) |
| FIRST_k, FOLLOW_k, k>1 christopher.f.clark@compiler-resources.com (Christopher F Clark) (2020-02-07) |
| Re: FIRST_k, FOLLOW_k, k>1 DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-02-08) |
| Re: FIRST_k, FOLLOW_k, k>1 borucki.andrzej@gmail.com (Andy) (2020-02-08) |
| Re: FIRST_k, FOLLOW_k, k>1 DrDiettrich1@netscape.net (Hans-Peter Diettrich) (2020-02-09) |
| Re: FIRST_k, FOLLOW_k, k>1 gaztoast@gmail.com (honey crisis) (2020-02-08) |
| From: | Andy <borucki.andrzej@gmail.com> |
| Newsgroups: | comp.compilers |
| Date: | Thu, 6 Feb 2020 10:43:24 -0800 (PST) |
| Organization: | Compilers Central |
| Injection-Info: | gal.iecc.com; posting-host="news.iecc.com:2001:470:1f07:1126:0:676f:7373:6970"; logging-data="48592"; mail-complaints-to="abuse@iecc.com" |
| Keywords: | parse, question |
| Posted-Date: | 06 Feb 2020 14:17:10 EST |
If LL(l) and LR(k) need sets FIRST_k, FOLLOW_k, k>1, for example LR(3) need this sets of degree 3?
How make it? How is the best structure for these sets? I think about pyramid:
- one bit - is epsilon
- bit table size n
- bit table size n^2
...
- bit table size n^k
because sets degree of k also have shorter strings.
This exponentially grows, in real grammars, number of tokens can be
quite big, ~80, It need then 0(80^k) bits. This sets will sparse and
is better organization of substrings in sets? For example, not bit set
but set of trees or DFA's ?
Return to the
comp.compilers page.
Search the
comp.compilers archives again.