Re: Simple Expression Recursion vs Expression/Term/Factor

"Luca" <lucads@xoommail.xoom.it>
8 Aug 2001 13:35:40 -0400

          From comp.compilers
Related articles
Simple Expression Recursion vs Expression/Term/Factor stoggers@uniquest.demon.co.uk (Mike Stogden) (2001-08-02)
Re: Simple Expression Recursion vs Expression/Term/Factor Mark.van.den.Brand@cwi.nl (M.G.J. van den Brand) (2001-08-06)
Re: Simple Expression Recursion vs Expression/Term/Factor lucadesantis@infinito.it (luca) (2001-08-06)
Re: Simple Expression Recursion vs Expression/Term/Factor gregod@cs.rpi.edu (Douglas Gregor) (2001-08-06)
Re: Simple Expression Recursion vs Expression/Term/Factor joachim_d@gmx.de (Joachim Durchholz) (2001-08-08)
Re: Simple Expression Recursion vs Expression/Term/Factor lucads@xoommail.xoom.it (Luca) (2001-08-08)
Re: Simple Expression Recursion vs Expression/Term/Factor andi@diagonal.ch (Andreas Gieriet) (2001-08-15)
| List of all articles for this month |
From: "Luca" <lucads@xoommail.xoom.it>
Newsgroups: comp.compilers
Date: 8 Aug 2001 13:35:40 -0400
Organization: Micron Technology, Inc.
References: 01-08-016 01-08-031 01-08-038
Keywords: parse
Posted-Date: 08 Aug 2001 13:35:40 EDT

Joachim Durchholz wrote in message 01-08-038...


>The unnecessary nodes will make tree traversal slower (since expressions
>are in almost any production, this will blow up the total tree size by a
>factor). Whether that's a problem depends on how much time the compiler
>actually spends traversing the tree.


You're right .


>Every precedence level is represented by one grammar rule;


This is done , for instance, in the original definition of C grammar by K&R,
where operators at the same precedence level are named as: 'additive
operators' (+,-) , 'multiplicative operators' ( * , / , % ) etc.etc.


bye


________________________
Luca De Santis
http://members.xoom.it/lucads

Post a followup to this message

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