6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-03 13:31:05 +00:00
Code Issues Projects Releases Wiki Activity

Fix a few typos I noticed.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@43220 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson 2007-10-22 06:48:28 +00:00
parent c333e4f0cb
commit c6311b9d62
1 changed files with 4 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
docs/tutorial/LangImpl2.html
View File

@ -118,7 +118,7 @@ about the syntax of the language. Note that there is no discussion about
precedence of binary operators, lexical structure etc.</p>
<p>For our basic language, these are all of the expression nodes we'll define.
because it doesn't have conditional control flow, it isn't turing complete:
Because it doesn't have conditional control flow, it isn't Turing-complete;
we'll fix that in a later installment. The two things we need next are a way
to talk about the interface to a function, and a way to talk about functions
themselves:</p>
@ -195,9 +195,7 @@ us to look one token ahead at what the lexer is returning. Every function in
our lexer will assume that CurTok is the current token that needs to be
parsed.</p>
<p>Again, we define
these with global variables: it would be better design to wrap the entire parser
in a class and use instance variables for these.
<p>Again, we define these with global variables; it would be better design to wrap the entire parser in a class and use instance variables for these.
</p>
<div class="doc_code">
@ -282,7 +280,7 @@ occur, the parser needs a way to indicate that they happened: in our parser, we
return null on an error.</p>
<p>Another interesting aspect of this function is that it uses recursion by
calling <tt>ParseExpression</tt> (we will soon see that ParseExpression can call
calling <tt>ParseExpression</tt> (we will soon see that <tt>ParseExpression</tt> can call
<tt>ParseParenExpr</tt>). This is powerful because it allows us to handle
recursive grammars, and keeps each production very simple. Note that
parenthesis do not cause construction of AST nodes themselves. While we could
@ -716,7 +714,7 @@ static void MainLoop() {
</div>
<p>The most interesting part of this is that we ignore top-level semi colons.
Why is this do you ask? The basic reason is that if you type "4 + 5" at the
Why is this, you ask? The basic reason is that if you type "4 + 5" at the
command line, the parser doesn't know that that is the end of what you will
type. For example, on the next line you could type "def foo..." in which case
4+5 is the end of a top-level expression. Alternatively you could type "* 6",