|Wanted: Pascal BNF firstname.lastname@example.org.OZ.AU (1992-04-16)|
|From:||email@example.com.OZ.AU (James R Boyle)|
|Keywords:||Pascal, parse, LL(1)|
|Date:||Thu, 16 Apr 1992 21:40:41 GMT|
I am in need of a LL(1) grammar for Standard Pascal, one that can be
easily hard coded into a recursive descent parser.
I would prefer one that is already single symbol lookahead or at least
the conflicts can be resolved by type checking.
As another request does anyone have an algorithm or code (preferably C
or Pascal) for checking the single symbol look ahead property of for
making a LL grammar single symbol lookahead.
Email rather than news please
- James Boyle
Return to the
Search the comp.compilers archives again.