Basically, I've written a parser for a language with just basic arithmetic operators ( +, -, * / ) etc, but for the minus and plus cases, the Abstract Syntax Tree which is generated has parsed them as right associative when they need to be left associative. Having googled for a solution, I found a tutorial that suggests rewriting the rule from:

```
Expression ::= Expression <operator> Term | Term`
```

to

`Expression ::= Term <operator> Expression*`

However, in my head this seems to generate the tree the wrong way round. Any pointers on a way to resolve this issue?

isbeing created, I presume there's no problem with the grammar you've written, which suggests there's a problem in the rewrite rules in your combined- or parser grammar (which I, or someone else, will then need to see).