Merge branch 'master' of github.com:IUCompilerCourse/Essentials-of-Compilation

Author: jsiek

book.tex

@@ -1328,7 +1328,7 @@ \section{Recursive Functions}
     [(Program '() e) (is_exp e)]
     [else #f]))
 
-(is_Lint (Program '() ast1_1)
+(is_Lint (Program '() ast1_1))
 (is_Lint (Program '()
        (Prim '* (list (Prim 'read '())
                       (Prim '+ (list (Int 8)))))))
@@ -1769,7 +1769,7 @@ \section{Example Compiler: A Partial Evaluator}
     case Expr(value):
       return Expr(pe_exp(value))
 
-def pe_P_int(p):
+def pe_Lint(p):
   match p:
     case Module(body):
       new_body = [pe_stmt(s) for s in body]
@@ -2016,7 +2016,7 @@ \subsection{Extensible Interpreters via Method Overriding}
 of commonality between these interpreters. We want to write down the
 common parts just once instead of many times. A naive interpreter for
 \LangVar{} would handle the \racket{cases for variables and
-  \code{let}} \python{case for variables} but dispatch to an
+  \code{let}}\python{case for variables} but dispatch to an
 interpreter for \LangInt{} in the rest of the cases. The following
 code sketches this idea. (We explain the \code{env} parameter in
 section~\ref{sec:interp-Lvar}.)
@@ -14846,7 +14846,7 @@ \section{Challenge: Generational Collection}
 time proportional to all the live data. One way to reduce this
 overhead is to reduce how much data is inspected in each call to
 \code{collect}. In particular, researchers have observed that recently
-allocated data is more likely to become garbage then data that has
+allocated data is more likely to become garbage than data that has
 survived one or more previous calls to \code{collect}. This insight
 motivated the creation of \emph{generational garbage collectors}
 \index{subject}{generational garbage collector} that