Newsgroups: | comp.compilers |
From: | rfg@netcom.com (Ronald F. Guilmette) |
Keywords: | errors, parse, tools, PCCTS |
Organization: | Netcom Online Communications Services (408-241-9760 login: guest) |
References: | 94-09-142 94-10-008 |
Date: | Wed, 5 Oct 1994 09:04:06 GMT |
johnm@po.EECS.Berkeley.EDU (John D. Mitchell) writes:
>... Go read Terrance Parr et al's papers about predicated-LL(k) parsing.
>It's implemented and used by a good number of people in the ANTLR parser
>generator that's part of the PCCTS. The use of syntactic and semantic
>predicates opens up the use of LL(k) parsing to a vastly larger world.
>Basically, syntactic predicates 'solve' the infinite lookahead problem and
>semantic predicates allows context dependent decisions to direct the parse.
One question... _Which_ ``infinite lookahead'' problem??
(You aren't by any chance speaking of C++ are you?)
--
-- Ron Guilmette, Sunnyvale, CA ----
---- domain addr: rfg@netcom.com ---
---- uucp addr: ...!uunet!netcom!rfg
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.