Lines Matching refs:expressions

23 parse the Kaleidoscope language (the latter for binary expressions and
34 Kaleidoscope, we have expressions, a prototype, and a function object.
35 We'll start with expressions first:
69 expressions. One thing that is nice about our AST is that it captures
96 With this scaffolding, we can now talk about parsing expressions and
131 which parses that production. We call this class of expressions
132 "primary" expressions, for reasons that will become more clear `later in
232 Now that basic expressions are handled, we need to handle binary
233 expressions. They are a bit more complex.
238 Binary expressions are significantly harder to parse because they are
281 expressions. The basic idea of operator precedence parsing is to break
285 expressions separated by binary operators. As such, it will first parse
288 primary expressions, the binary expression parser doesn't need to worry
430 This wraps up handling of expressions. At this point, we can point the
442 expressions):
485 Finally, we'll also let the user type in arbitrary top-level expressions