I\'m trying to figure out how to do a left-associative expression where recursive (not-enclosed in anything) expressions are possible. For example, I\'d like to do:
Pyparsing produces left parse trees. Add a semantic action to edit the parse tree right after expr has been parsed.
expr