Parsing algorithms may be top-down or bottom-up. Expression Grammar
E -> E + T | T T -> T * F | F F -> ( E ) | id
Left-recursive precedence cascade grammar.