home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!ogicse!das-news.harvard.edu!spdcc!iecc!compilers-sender
- From: zou@flora.ccs.northeastern.edu (Chendong Zou)
- Newsgroups: comp.compilers
- Subject: LALR grammar hints
- Keywords: LALR, question
- Message-ID: <92-11-026@comp.compilers>
- Date: 5 Nov 92 15:45:56 GMT
- Article-I.D.: comp.92-11-026
- Sender: compilers-sender@iecc.cambridge.ma.us
- Reply-To: zou@flora.ccs.northeastern.edu (Chendong Zou)
- Organization: College of CS, Northeastern U
- Lines: 18
- Approved: compilers@iecc.cambridge.ma.us
-
- 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
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-