> This is not true if a, b and c are unsigned True, but this is not valid if they are signed, either. Take a = INT_MIN b = 1 c = 2 Then a < b + c is true. But a - b < c invokes undefined behavior. Edit: missed > Say…
The reason for using a match statement, even though there is only “one” case, is because it’s matching against a complex and (as you mentioned) deeply nested pattern. Lines 43-56 match the current AST node against the…
What a coincidence, I just started watching his Programming Languages Theory lectures. Seems like a wonderful professor.
> This is not true if a, b and c are unsigned True, but this is not valid if they are signed, either. Take a = INT_MIN b = 1 c = 2 Then a < b + c is true. But a - b < c invokes undefined behavior. Edit: missed > Say…
The reason for using a match statement, even though there is only “one” case, is because it’s matching against a complex and (as you mentioned) deeply nested pattern. Lines 43-56 match the current AST node against the…
What a coincidence, I just started watching his Programming Languages Theory lectures. Seems like a wonderful professor.