home *** CD-ROM | disk | FTP | other *** search
- Path: sparky!uunet!haven.umd.edu!darwin.sura.net!spool.mu.edu!caen!zaphod.mps.ohio-state.edu!cis.ohio-state.edu!rutgers!faatcrl!iecc!compilers-sender
- From: bburshte@pyramid.com (Boris Burshteyn)
- Newsgroups: comp.compilers
- Subject: Re: Parsing wars
- Keywords: parse
- Message-ID: <92-09-069@comp.compilers>
- Date: 13 Sep 92 21:16:18 GMT
- References: <92-09-006@comp.compilers> <92-09-043@comp.compilers>
- Sender: compilers-sender@iecc.cambridge.ma.us
- Reply-To: bburshte@pyramid.com (Boris Burshteyn)
- Organization: Compilers Central
- Lines: 22
- Approved: compilers@iecc.cambridge.ma.us
-
- jar@cheops.HQ.Ileaf.COM (Jim Roskind x5570) writes [about "strange parsing"]
-
- >The conseqeunces of this extension are quite significant, and the
- >resulting parser engine provides a much larger class of parsers than LR
- >parsers. ...
-
- The idea of several passes over the reduction stack has also been
- expressed in my paper in SIGPLAN NOTICES V.27 N.1, 1992.
-
- A parser built upon a modifiable grammar changes the set of available
- context-free rules on the fly while parsing the source. If it cannot
- continue, it backtracks and tries to reduce tokens (terminals &
- nonterminals) from the stack. It may indeed find something to reduce
- because of new rules introduced dynamically. Several backtracking attempts
- can be made, and the set of rules may be changed while reparsing the
- stack. There is also an example of parsing of expressions before
- declaration of variables.
-
- Regards - Boris Burshteyn (bburshte@pyramid.com)
- --
- Send compilers articles to compilers@iecc.cambridge.ma.us or
- {ima | spdcc | world}!iecc!compilers. Meta-mail to compilers-request.
-