Prechádzať zdrojové kódy

Merge branch 'IUCompilerCourse:master' into master

Programming Languages Uni Freiburg 3 rokov pred
rodič
commit
221824938b
2 zmenil súbory, kde vykonal 10 pridanie a 8 odobranie
  1. 9 7
      book.tex
  2. 1 1
      defs.tex

+ 9 - 7
book.tex

@@ -25,7 +25,7 @@
 
 \def\racketEd{0}
 \def\pythonEd{1}
-\def\edition{1}
+\def\edition{0}
 
 % material that is specific to the Racket edition of the book
 \newcommand{\racket}[1]{{\if\edition\racketEd{#1}\fi}}
@@ -10502,10 +10502,10 @@ generate better code by taking this fact into account.
 
 The output language of \code{explicate\_control} is \LangCLoop{}
 (Figure~\ref{fig:c7-syntax}), which is nearly identical to
-\LangCIf{}. The only syntactic difference is that
-\code{read} may also appear as a statement.  The most significant
-difference between programs in \LangCIf{} and programs in \LangCLoop{},
-generated by the passes of the compiler,
+\LangCIf{}. The only syntactic difference is that \code{read} may also
+appear as a statement.  The most significant difference between the
+programs generated by \code{explicate\_control} in
+Chapter~\ref{ch:Lif} versus \code{explicate\_control} in this chapter
 is that the control-flow graphs of the later may contain cycles.
 
 \begin{figure}[tp]
@@ -14250,10 +14250,12 @@ include all the caller-saved registers. Recall that the reason for
 that is to force variables that are live across a function call to be assigned to callee-saved
 registers or to be spilled to the stack.
 
-Regarding the set of read locations $R$ the arity field of
+Regarding the set of read locations $R$, the arity field of
 \code{TailJmp} and \code{IndirectCallq} determines how many of the
 argument-passing registers should be considered as read by those
-instructions.
+instructions. Also, the target field of \code{TailJmp} and
+\code{IndirectCallq} should be included in the set of read locations
+$R$.
 
 \subsection{Build Interference Graph}
 \label{sec:build-interference-r4}

+ 1 - 1
defs.tex

@@ -233,7 +233,7 @@
 \newcommand{\CNOT}[1]{\LP\key{not}~#1\RP}
 \newcommand{\CALL}[2]{\key{Call}\LP #1\code{, } #2 \RP}
 \newcommand{\APPLY}[2]{\key{(Apply}~#1~#2\code{)}}
-\newcommand{\CAPPLY}[2]{\LP~#1~#2\RP}
+\newcommand{\CAPPLY}[2]{\LP#1~#2\RP}
 \newcommand{\FUNREF}[1]{\LP\key{FunRef}~#1\RP}
 \newcommand{\CFUNREF}[1]{\key{(fun-ref}~#1\code{)}}
 \fi