Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| LL Parser problem jdlessl@yahoo.com (2004-08-09) |
| Re: LL Parser problem jdlessl@yahoo.com (2004-08-10) |
| Re: LL Parser problem wyrmwif@tsoft.org (SM Ryan) (2004-08-11) |
| Re: LL Parser problem nick.roberts@acm.org (Nick Roberts) (2004-08-13) |
| Re: LL Parser problem cfc@shell01.TheWorld.com (Chris F Clark) (2004-08-15) |
| Re: LL Parser problem nick.roberts@acm.org (Nick Roberts) (2004-08-23) |
| Re: LL Parser problem rich@pennware.com (Richard Pennington) (2004-08-25) |
| Re: LL Parser problem vbdis@aol.com (2004-09-03) |
| Re: LL Parser problem cfc@shell01.TheWorld.com (Chris F Clark) (2004-09-07) |
| From: | SM Ryan <wyrmwif@tsoft.org> |
| Newsgroups: | comp.compilers |
| Date: | 11 Aug 2004 12:53:27 -0400 |
| Organization: | Quick STOP Groceries |
| References: | 04-08-060 |
| Keywords: | lex |
| Posted-Date: | 11 Aug 2004 12:53:27 EDT |
jdlessl@yahoo.com (Jared Lessl) wrote:
# > [Special case the lexer to return a mutant < token after an array
# > name. -John]
#
# Except that in AREV, any variable or function return value can be an
# array of this type. The only assurance I can have that a '<' is not
# an array index is if it immediately follows a literal or numerical
# value.
If you have two different derivations
Z -> X -> A<B>
and Z -> Y -> A<B
where B has an unbounded expansion, then it isn't LL(k). To be LL(k) you
have to be able choose X or Y by left context + at most k symbols. In this
case you have traverse the entire expansion of B which can be more than
k symbols.
--
SM Ryan http://www.rawbw.com/~wyrmwif/
Return to the
comp.compilers page.
Search the
comp.compilers archives again.