Work on priorities for the new parser:

    - uses the offline visitor to filter out illegal parse trees.
    - uses the old inefficient way to calculate the reachability between two productions
               (TODO: implement an efficient graph reachability algorithm)
    - updated the examples and added them to ktest
    - TODO: make the same for left and right associativity