Lines Matching refs:our

14 `parser <http://en.wikipedia.org/wiki/Parsing>`_ for our Kaleidoscope
99 expressions. One thing that is nice about our AST is that it captures
104 For our basic language, these are all of the expression nodes we'll
173 in our parser will assume that CurTok is the current token that needs to
189 The ``Error`` routines are simple helper routines that our parser will
190 use to handle errors. The error recovery in our parser will not be the
191 best and is not particular user-friendly, but it will be enough for our
196 our grammar: numeric literals.
202 process. For each production in our grammar, we'll define a function
249 they happened: in our parser, we return null on an error.
311 Now that we have all of our simple expression-parsing logic in place, we
388 operators (this can obviously be extended by you, our brave and intrepid
427 returns the expression that is passed into it. In our example above, the
490 to the precedence of our current operator, then we know that the
491 parentheses associate as "(a+b) binop ...". In our example, the current
507 In our example above, this will turn "a+b+" into "(a+b)" and execute the
517 our example, it needs to get all of "(c+d)\*e\*f" as the RHS expression
537 At this point, we know that the binary operator to the RHS of our
543 continue. In our example above, this will cause it to return the AST
688 non-blank code), we fully defined our minimal language, including a