|Parsing with infinite lookahead Matt_Timmermans@msl.isis.org (Matt Timmermans/MSL) (1994-02-22)|
|Re: Parsing with infinite lookahead email@example.com (1994-02-24)|
|Parsing with infinite lookahead firstname.lastname@example.org (Stephen J Bevan) (1994-02-24)|
|Re: Parsing with infinite lookahead email@example.com (1994-02-24)|
|Re: Parsing with infinite lookahead firstname.lastname@example.org (Terence Parr) (1994-02-25)|
|Re: Parsing with infinite lookahead corbett@lupa.Eng.Sun.COM (1994-02-26)|
|Re: Parsing with infinite lookahead email@example.com (1994-02-27)|
|[4 later articles]|
|From:||Matt Timmermans/MSL <Matt_Timmermans@msl.isis.org>|
|Keywords:||parse, theory, question|
|Date:||Tue, 22 Feb 1994 16:30:32 GMT|
Does anyone know of a deterministic method for parsing any unambiguous
context-free grammar -- including those that require infinite lookahead?
S: A a | B b
A: c | A c
B: c | B c
If not, does anyone know of a deterministic method for determining whether or
not a context-free grammar is ambiguous?
Also, does anyone know for certain whether or not the language of any
context-free grammar can be recognized by a 1DPDA. If so, how is the
corresponding PDA constructed?
Matt Timmermans | Phone: +1 613 727-5696
Microstar Software Ltd. | Fax: +1 613 727-9491
34 Colonnade Rd. North | BBS: +1 613 727-5272
Nepean Ontario CANADA K2E-7J6 | E-mail: firstname.lastname@example.org
Return to the
Search the comp.compilers archives again.