Archives/jamiebuilds_the-super-tiny-compiler
1
0
Fork 0
mirror of https://github.com/jamiebuilds/the-super-tiny-compiler.git synced 2024-10-27 20:34:08 +00:00
Code Issues Projects Releases Wiki Activity

Update super-tiny-compiler.js :: wording, grammar

Browse Source 
78 tiny teeny --> teeny tiny
214 create and entirely --> create an entirely
654 <code>traverser</code> --> traverser
This commit is contained in:
miltonsegura 2016-03-31 12:50:14 -04:00
parent 8a18ac0a3c
commit 22670a21f6
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
super-tiny-compiler.js
View File

@ -75,7 +75,7 @@
/**
* Today we're going write a compiler together. But not just any compiler... A
* super duper tiny teeny compiler! A compiler that is so small that if you
* super duper teeny tiny compiler! A compiler that is so small that if you
* remove all the comments this file would only be ~200 lines of actual code.
*
* We're going to compile some lisp-like function calls into some C-like
@ -211,7 +211,7 @@
*
* When transforming the AST we can manipulate nodes by
* adding/removing/replacing properties, we can add new nodes, remove nodes, or
* we could leave the existing AST alone and create and entirely new one based
* we could leave the existing AST alone and create an entirely new one based
* on it.
*
* Since we’re targeting a new language, we’re going to focus on creating an
@ -650,7 +650,7 @@ function parser(tokens) {
* });
*/
// So we define a <code>traverser</code> function which accepts an AST and a
// So we define a traverser function which accepts an AST and a
// visitor. Inside we're going to define two functions...
function traverser(ast, visitor) {