This seems to work... I am guessing it is basically the shortcut way to do what blokhead proposed... I was able to get it to return a little less depth in the tree, though it isn't quite perfect.

Here is my grammar, for posterity's sake. 

my $grammar = <<'GRAMMAR'

  {
      use strict;
      use warnings;

      sub treeify {
         my $t = shift;
#     my($l,$r) = (shift,shift);
     while(@_) {
         my($l,$r) = (shift,shift);
         
         $t = [ 'op',$l, (ref $t eq 'ARRAY' && !$#$t ? @$t : $t), (ref
+ $r eq 'ARRAY' && !$#$r ? @$r : $r) ]
     }
         return $t;
      }
   }

  startrule: bin_op

  bin_op: comp_op 
 # Lowest precendance.
  comp_op: <leftop: add_op COMP add_op>
              { treeify(@{$item[1]}); }

   add_op: <leftop: prod_op SUM prod_op >
              { treeify(@{$item[1]}); }

   prod_op : <leftop: mod_op PROD mod_op >
              { treeify(@{$item[1]}); }
   # Highest precendance.

   mod_op : <leftop: term MOD term >
              { treeify(@{$item[1]}); }

   SUM      : '+' | '-'
   PROD     : '*' | '/'
   MOD      : '%'
   COMP     : />=?|<=?|!=|==?|le|ge|eq|ne|lt|gt/


  term: function 
            | '(' bin_op ')' { $item[2] }
            | number
            | string

  if: /if/i '(' list_bin_op list_bin_op bin_op ')' { ['func',@item[1,3
+..5]] }
  concat: /concat/i '(' list_bin_op(s) bin_op ')' { ['func',$item[1],@
+{$item[3]},$item[4]] }
  left: /left/i '(' list_bin_op bin_op ')' { ['func',@item[1,3,4]] }
  right: /right/i '(' list_bin_op bin_op ')' { ['func',@item[1,3,4]] }
  ifnull: /ifnull/i '(' list_bin_op bin_op ')' { ['func',@item[1,3,4]]
+ }

  function: if | concat | left | right | ifnull

  number: /[+-]?\d+/ { $item[1] }
  string: { $_ = extract_quotelike($text); chop; substr($_,0,1,''); $_
+; } { [@item] }

#$thisparser->startrule($item[2],1,$type)

  list_bin_op: bin_op ',' { $item[1] }

GRAMMAR
;

[download]
This is actually parsing MySQL-like statements, so there is a bit in there for some function definitions, seems to work, though. Thanks all!

                - Ant
                - Some of my best work - (1 2 3)

In reply to Re^2: Order of Precedence in Parse::RecDescent grammar by suaveant
in thread Order of Precedence in Parse::RecDescent grammar by suaveant

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post, it's "PerlMonks-approved HTML":


  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, details, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, summary, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.