home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.lang.misc
- Path: sparky!uunet!news.gtech.com!noc.near.net!lynx!random.ccs.northeastern.edu!zou
- From: zou@ccs.northeastern.edu (Chendong Zou)
- Subject: LALR grammar
- Message-ID: <1992Nov5.154705.14979@random.ccs.northeastern.edu>
- Sender: news@random.ccs.northeastern.edu
- Nntp-Posting-Host: sun3140l.ccs.northeastern.edu
- Organization: College of CS, Northeastern U
- Date: Thu, 5 Nov 1992 15:47:05 GMT
- Lines: 16
-
- Hi:
-
- I am now try to design a grammar to preprocess some technical papers using a
- LALR parser.
-
- I wonder if there is a general rule to design a grammar to guarantee it to be
- a LALR(1). For sometimes, if you do some tricky changes, a non-LALR(1) grammar
- will become a LALR(1).
-
- Any suggestions? or can you recommend some books to read?
-
- Please email me directly.
- Thank you!
-
- -- Zou
-
-