Skip to content

Commit

Permalink
Typo/whitespace fixes
Browse files Browse the repository at this point in the history
  • Loading branch information
Benabik committed Apr 18, 2012
1 parent d207a53 commit 509afea
Show file tree
Hide file tree
Showing 4 changed files with 11 additions and 11 deletions.
12 changes: 6 additions & 6 deletions README.mkd
Expand Up @@ -47,7 +47,7 @@ some uses in particular to keep in mind:
* Alternate lexing/parsing frameworks * Alternate lexing/parsing frameworks
* Including low-level code in high-level <br /> * Including low-level code in high-level <br />
(Think POST nodes in a PAST tree. A more structured version of inline (Think POST nodes in a PAST tree. A more structured version of inline
nodes) nodes.)
* Compiling portions of a program.<br /> * Compiling portions of a program.<br />
(Given a PAST expression, return a POST expression not a full program.) (Given a PAST expression, return a POST expression not a full program.)


Expand Down Expand Up @@ -95,11 +95,11 @@ the ability to perform them should be kept in mind.


### Round-Trip Code ### Round-Trip Code


The generating high quality code is difficult when the output of the Generating high quality code is difficult when the output of the compiler
compiler is opaque. PASM is a mostly dead format and PIR is often derided is opaque. PASM is a mostly dead format and PIR is often derided for both
for both the amount of hidden work it does and its compiler IMCC. New the amount of hidden work it does and its compiler IMCC. New assembly and
assembly and intermediate formats are required. These formats should be as intermediate formats are required. These formats should be as easy to
easy to generate and process as possible. generate and process as possible.


The ability to store arbitrary objects in bytecode files means that not The ability to store arbitrary objects in bytecode files means that not
every PBC can be regenerated faithfully from disassembly, but handling the every PBC can be regenerated faithfully from disassembly, but handling the
Expand Down
4 changes: 2 additions & 2 deletions TODO.mkd
Expand Up @@ -24,8 +24,8 @@ around, starting from the bytecode and working our way up seems far more
useful. The implementation plan looks a little like this: useful. The implementation plan looks a little like this:


* Build a set of classes that mirror packfile layout. * Build a set of classes that mirror packfile layout.
* Populated with PACT classes like Sub, Op, etc instead of * Populated with PACT classes like Sub, Op, etc instead of
PackfileConstantTable PackfileConstantTable, etc
* Make that able to produce bytecode and PIR * Make that able to produce bytecode and PIR
* Register allocation * Register allocation
* Stage structure * Stage structure
Expand Down
4 changes: 2 additions & 2 deletions docs/compiling.mkd
Expand Up @@ -58,8 +58,8 @@ points. (Perhaps this should standardized to an array of strings.)


### Default Visit Methods ### Default Visit Methods


Stages should generally through unknown types. Obviously some stages will Stages should generally pass through unknown types. Obviously some stages
be more strict. will be more strict.


method visit(var node) { method visit(var node) {
return node; return node;
Expand Down
2 changes: 1 addition & 1 deletion docs/nodes.mkd
Expand Up @@ -2,7 +2,7 @@


PACT is based around the concept of tree transformations. The High Level PACT is based around the concept of tree transformations. The High Level
Language (HLL) handles parsing source text however it wants to and builds Language (HLL) handles parsing source text however it wants to and builds
a PAST tree for PACT to handle. That tree is converted into several as AST tree for PACT to handle. That tree is converted into several
intermediate forms before being turned into bytecode, PIR, or executed. intermediate forms before being turned into bytecode, PIR, or executed.


Some level of organization is going to be needed for these. This document Some level of organization is going to be needed for these. This document
Expand Down

0 comments on commit 509afea

Please sign in to comment.