Parsing & Lowering Checkpoint

1. Given `1 + 2 * 3`, the correct grouping is:

1 + (2 * 3) (1 + 2) * 3 (1 * 2) + 3 1 + (2 / 3)

2. To parse left-associative operators in recursive descent, you usually:

Use a loop at that precedence level Use right recursion only Reverse the token list Skip unary operators

3. In this pack, function calls are allowed on:

Identifiers only Any expression Numbers only Binary expressions only

4. Why does bytecode emit left, then right, then the operator?

5. Which operator should be checked before its single-character version during lexing?

<= + - .