[Boost-users] [Spirit] seeking help with AST tree generation

13 Jun 2009

      Hello,

Using Boost Spirit, is it possible to write a grammar that, out of the 
box, generates the AST tree according to cases below:

Case 1:
=======

Input:

  1 < 2 AND 3 < 4 OR 5 < 6

Resulting tree:

          OR
        /    \
      AND     5 < 6
     /   \
1 < 2   3 < 4

Case 2:
=======

Input:

   1 < 2 AND (3 < 4 OR 5 < 6)

Resulting tree:

         AND
        /    \
    1 < 2     OR
             /   \
        3 < 4   5 < 6

In other words, I want to honor the parenthesis for expression grouping.

How would you recommend doing it?

Thank you,
Slaw

Slawomir Lisznianski