소스 검색

edits to diagrams

Jeremy G. Siek 2 년 전
부모
커밋
d0a1918f77
2개의 변경된 파일21개의 추가작업 그리고 21개의 파일을 삭제
  1. 11 10
      book.tex
  2. 10 11
      python.bib

+ 11 - 10
book.tex

@@ -2,8 +2,6 @@
 
 % TODO:
 %
-% * TOC: Boolans and Conditions, move to page 2
-
 
 \usepackage[utf8]{inputenc}
 %% \usepackage{setspace}
@@ -2937,7 +2935,7 @@ that uses a reserved register to fix outstanding problems.
 \node (x86-4) at (12,0) {\large \LangXInt{}};
 
 \path[->,bend left=15] (Lvar) edge [above] node {\ttfamily\footnotesize remove\_complex\_operands} (Lvar-2);
-\path[->,bend left=15] (Lvar-2) edge [left] node {\ttfamily\footnotesize select\_instructions} (x86-1);
+\path[->,bend left=15] (Lvar-2) edge [left] node {\ttfamily\footnotesize select\_instructions\ \ } (x86-1);
 \path[->,bend right=15] (x86-1) edge [below] node {\ttfamily\footnotesize assign\_homes} (x86-2);
 \path[->,bend left=15] (x86-2) edge [above] node {\ttfamily\footnotesize patch\_instructions} (x86-3);
 \path[->,bend right=15] (x86-3) edge [below] node {\ttfamily\footnotesize prelude\_and\_conclusion} (x86-4);
@@ -7508,6 +7506,9 @@ be more appropriate.
 
 
 %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
+{\if\edition\racketEd
+\addtocontents{toc}{\newpage}
+\fi}
 \chapter{Booleans and Conditionals}
 \label{ch:Lif}
 \setcounter{footnote}{0}
@@ -11893,7 +11894,7 @@ The \code{analyze\_dataflow} function has the following four parameters.
 \path[->,bend left=15] (Lfun-2) edge [above] node
      {\ttfamily\footnotesize remove\_complex\_operands} (F1-6);
 \path[->,bend left=10] (F1-6) edge [right] node
-     {\ttfamily\footnotesize explicate\_control} (C3-2);
+     {\ttfamily\footnotesize \ \ explicate\_control} (C3-2);
 \path[->,bend right=15] (C3-2) edge [right] node
      {\ttfamily\footnotesize select\_instructions} (x86-2);
 \path[->,bend right=15] (x86-2) edge [below] node
@@ -13627,7 +13628,7 @@ conclusion:
 \path[->,bend left=15] (Lvec) edge [above] node {\ttfamily\footnotesize shrink} (Lvec-2);
 \path[->,bend left=15] (Lvec-2) edge [above] node {\ttfamily\footnotesize expose\_allocation} (Lvec-5);
 \path[->,bend left=15] (Lvec-5) edge [above] node {\ttfamily\footnotesize remove\_complex\_operands} (Lvec-6);
-\path[->,bend left=10] (Lvec-6) edge [right] node {\ttfamily\footnotesize explicate\_control} (C2-4);
+\path[->,bend left=10] (Lvec-6) edge [right] node {\ttfamily\footnotesize \ \ \ explicate\_control} (C2-4);
 \path[->,bend left=15] (C2-4) edge [right] node {\ttfamily\footnotesize select\_instructions} (x86-2);
 \path[->,bend right=15] (x86-2) edge [below] node {\ttfamily\footnotesize assign\_homes} (x86-3);
 \path[->,bend left=15] (x86-3) edge [above] node {\ttfamily\footnotesize patch\_instructions} (x86-4);
@@ -16086,7 +16087,7 @@ previously created test programs.
 \path[->,bend left=15] (F1-1) edge [above] node
      {\ttfamily\footnotesize limit\_functions} (F1-2);
 \path[->,bend left=15] (F1-2) edge [right] node
-     {\ttfamily\footnotesize expose\_allocation} (F1-4);
+     {\ttfamily\footnotesize \ \ expose\_allocation} (F1-4);
 \path[->,bend right=15] (F1-4) edge [above] node
      {\ttfamily\footnotesize remove\_complex\_operands} (F1-5);
 \path[->,bend right=15] (F1-5) edge [right] node
@@ -19860,8 +19861,8 @@ completion without error.
      {\ttfamily\footnotesize uncover\_get!} (F1-5);
 \path[->,bend left=15] (F1-5) edge [above] node
      {\ttfamily\footnotesize remove\_complex\_operands} (F1-6);
-\path[->,bend left=15] (F1-6) edge [below] node
-     {\ttfamily\footnotesize explicate\_control} (C3-2);
+\path[->,bend left=10] (F1-6) edge [below] node
+     {\ttfamily\footnotesize \ \ \ \ \ explicate\_control} (C3-2);
 \path[->,bend left=15] (C3-2) edge [right] node
      {\ttfamily\footnotesize select\_instructions} (x86-2);
 \path[->,bend right=15] (x86-2) edge [right] node
@@ -19917,8 +19918,8 @@ completion without error.
      {\ttfamily\footnotesize expose\_allocation} (F1-5);
 \path[->,bend left=15] (F1-5) edge [above] node
      {\ttfamily\footnotesize remove\_complex\_operands} (F1-6);
-\path[->,bend left=15] (F1-6) edge [below] node
-     {\ttfamily\footnotesize explicate\_control} (C3-2);
+\path[->,bend left=10] (F1-6) edge [below] node
+     {\ttfamily\footnotesize \ \ \ \ \ \ \ \ explicate\_control} (C3-2);
 \path[->,bend right=15] (C3-2) edge [right] node
      {\ttfamily\footnotesize select\_instructions} (x86-2);
 \path[->,bend right=15] (x86-2) edge [below] node

+ 10 - 11
python.bib

@@ -54,10 +54,11 @@
 
 @inproceedings{Dieckmann99,
   author    = {Sylvia Dieckmann and Urs H{\"{o}}lzle},
-  title     = {A Study of the Allocation Behavior of the SPECjvm98 Java Benchmark},
-  booktitle = {Proceedings of the 13th European Conference on Object-Oriented Programming},
-  series    = {Lecture Notes in Computer Science},
-  volume    = 1628,
+  title     = {A Study of the Allocation Behavior of the SPECjvm98
+                  Java Benchmark},
+  booktitle = {Proceedings of the 13th European Conference on
+                  Object-Oriented Programming, ECOOP 1999,
+                  \normalfont{Lecture Notes in Computer Science 1628}},
   pages     = {92--115},
   publisher = {Springer},
   year      = 1999
@@ -67,14 +68,12 @@
 author = {Dunfield, Jana and Krishnaswami, Neel},
 title = {Bidirectional Typing},
 year = 2021,
-issue_date = {June 2022},
 publisher = {Association for Computing Machinery},
 volume = 54,
 number = 5,
 journal = {ACM Comput. Surv.},
 articleno = 98,
-numpages = 38,
-keywords = {type inference, Type checking}
+numpages = 38
 }
 
 @Misc{Lehtosalo2021:MyPy,
@@ -92,8 +91,7 @@ publisher = {Association for Computing Machinery},
 volume = 22,
 number = 1,
 journal = {ACM Trans. Program. Lang. Syst.},
-pages = {1--44},
-keywords = {subtyping, polymorphism, type inference}
+pages = {1--44}
 }
 
 @misc{shinan20:_lark_docs,
@@ -105,7 +103,8 @@ keywords = {subtyping, polymorphism, type inference}
 @book{Tomita:1985qr,
 	author = {Masaru Tomita},
 	publisher = {Kluwer Academic Publishers},
-	title = {Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems},
+	title = {Efficient Parsing for Natural Language: A Fast
+                  Algorithm for Practical Systems},
 	year = {1985}}
 
 @article{Earley:1970ly,
@@ -141,7 +140,7 @@ keywords = {subtyping, polymorphism, type inference}
 	organization = {AT\&T},
 	pages = {353--387},
 	publisher = {Holt, Rinehart, and Winston},
-	title = {YACC: Yet another compiler-compiler},
+	title = {{YACC}: Yet another compiler-compiler},
 	volume = {2},
 	year = {1979}}