Resolve Variables and Relations while parsing using semantic predicates of ANTLR

[ferhaterata]

Algorithm: If a variable is defined in a quantifier, comprehension or let declaration, semantically resolve all identifiers with the same name as variables in the scope of that declaration. Resolve other identifiers in the scope as relations. This approach maintains a good approximation for a semantically valid parse tree since the variables are always declared before using them. Variables may shadow each other, and may shadow field names. Conventional lexical scoping, with the innermost binding taking precedence.