Re: Precedence based parsing

Derk Gwen <derkgwen@HotPOP.com>
2 Jan 2004 03:40:25 -0500

          From comp.compilers
Related articles
[5 earlier articles]
Re: Precedence based parsing toby@telegraphics.com.au (2003-12-13)
Re: Precedence based parsing robert.thorpe@antenova.com (Rob Thorpe) (2003-12-13)
Re: Precedence based parsing clint@0lsen.net (Clint Olsen) (2003-12-20)
Re: Precedence based parsing sjmeyer@www.tdl.com (Steve Meyer) (2003-12-23)
Re: Precedence based parsing joachim.durchholz@web.de (Joachim Durchholz) (2003-12-27)
Re: Precedence based parsing haberg@matematik.su.se (2003-12-27)
Re: Precedence based parsing derkgwen@HotPOP.com (Derk Gwen) (2004-01-02)
| List of all articles for this month |
From: Derk Gwen <derkgwen@HotPOP.com>
Newsgroups: comp.compilers
Date: 2 Jan 2004 03:40:25 -0500
Organization: Quick STOP Groceries
References: 03-12-139
Keywords: parse
Posted-Date: 02 Jan 2004 03:40:25 EST

haberg@matematik.su.se (Hans Aberg) wrote:
# sjmeyer@pragmatic-c.com wrote:
#
# > Verilog expressions are complex and language is irregular and non context
# >free. For example, scanner requires information from state of parser to
# >distinguish tokens. Such language constructs are what hardware designers
# >want.
#
# This is a common lexer tweak in languages that are implemented with
# context free parser generators. Since many strictly non-context free


Or create a different scanner for each parse state.


--
Derk Gwen http://derkgwen.250free.com/html/index.html
God's a skeeball fanatic.


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.