From ee213edb8849a985b61f4ef735ce06e6a01aad70 Mon Sep 17 00:00:00 2001
From: aarne <unknown>
Date: Sun, 26 Sep 2004 16:10:04 +0000
Subject: [PATCH] 2 typos

---
 examples/gfcc/complin.tex | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/examples/gfcc/complin.tex b/examples/gfcc/complin.tex
index 30b4908ef..324c97e11 100644
--- a/examples/gfcc/complin.tex
+++ b/examples/gfcc/complin.tex
@@ -505,7 +505,7 @@ constituents. The linearization of such a constituent
 is compositionally defined to be the record linearizing the body
 extended with fields for each of the variable symbols:
 \[
-\sugmap{\lambda x_{0} \rarrow \cdots \rarrow \lambda x_{n} \rarrow b}
+\sugmap{(\lambda x_{0} \rarrow \cdots \rarrow \lambda x_{n} \rarrow b)}
 \;=\;
 \sugmap{b} *\!* \{\$_{0} = \sugmap{x_{0}} ; \ldots ; \$_{n} = \sugmap{x_{n}}\}
 \]
@@ -747,7 +747,7 @@ in Appendix C, we do not treat symbol tables
 in linearization, but instead generated code in
 \empha{Symbolic JVM}---that is, JVM with symbolic addresses.
 Therefore we need a postprocessor that resolves the symbolic addresses,
-shown in Appendix D.
+shown in Appendix E.
 
 To make the postprocessor straightforward,
 Symbolic JVM has special \texttt{alloc} instructions,