This site uses cookies only for the purpose of identifying user sessions.
This is required to properly register actions.
Exercise
1›:
Expressions over binary +
The set of tokens of the language is {+,NUMBER}. The
token NUMBER represents unsigned integers, i.e., non-empty sequences of
digits. Recall that “1”, “2+3” and “4+5+6+7” are
correct expressions, whereas “+”, “6+” and “1 2” are
not. The generated AST must correspond to an interpretation of + as a
left-associative operator. For example, for input 1+2+3, the resulting
AST must be +(+(1,2),3), i.e., as if the implicit parenthesization was
(1+2)+3.
Authors: Carles Creus, Guillem Godoy, Nil Mamano
/
Documentation: