s/####\s\s*answer/#### Answer/

Or in natural language: Substitute answer with Answer.

Author: eliasdiem

ch02/2.2/2.2.md

@@ -10,7 +10,7 @@ S -> S S + | S S * | a
 2. Construct a parse tree for this string.
 3. What language does this grammar generate? Justify your answer.
 
-#### answer
+#### Answer
 
 1. `S` -> `S` S * -> `S` S + S * -> a `S` + S * -> a a + `S` * -> a a + a *
 2. ![Syntax tree](https://raw.github.com/fool2fish/dragon-book-practice-answer/master/ch02/2.2/assets/2.2.1-2.png)
@@ -26,7 +26,7 @@ What language is generated by the following grammars? In each case justify your
 4. S -> a S b S | b S a S | ε
 5. S -> a | S + S | S S | S * | ( S )
 
-#### answer
+#### Answer
 
 1. L = {0<sup>n</sup>1<sup>n</sup> | n>=1}
 2. L = {Prefix expression consisting of plus and minus signs}
@@ -38,7 +38,7 @@ What language is generated by the following grammars? In each case justify your
 
 Which of the grammars in Exercise 2.2.2 are ambiguous
 
-#### answer
+#### Answer
 
 1. No
 2. No
@@ -65,7 +65,7 @@ the following languages. In each case show that your grammar is correct.
 3. Right-associative lists of identifiers separated by commas.
 4. Arithmetic expressions of integers and identifiers with the four binary operators +, - , *, /.
 
-#### answer
+#### Answer
 
 ```
 1. E -> E E op | num
@@ -92,7 +92,7 @@ the following languages. In each case show that your grammar is correct.
 
 2.  Does the grammar generate all binary strings with values divisible by 3?
 
-#### answer
+#### Answer
 
 1. proof
 
@@ -142,7 +142,7 @@ Construct a context-free grammar for roman numerals.
 **Note:** we just consider a subset of roman numerals which is less than 4k.
 
 
-#### answer
+#### Answer
 
 [wikipedia: Roman_numerals](http://en.wikipedia.org/wiki/Roman_numerals)
 

ch02/2.3/2.3.md

@@ -7,7 +7,7 @@ expressions from infix notation into prefix notation in which an operator
 appears before its operands; e.g. , -xy is the prefix notation for x - y. Give
 annotated parse trees for the inputs 9-5+2 and 9-5*2.
 
-#### answer
+#### Answer
 
 productions:
 
@@ -40,7 +40,7 @@ Construct a syntax-directed translation scheme that translates arithmetic
 expressions from postfix notation into infix notation. Give annotated parse
 trees for the inputs 95-2* and 952*-.
 
-#### answer
+#### Answer
 
 productions:
 
@@ -73,7 +73,7 @@ E -> {print("(")} E {print(op)} E {print(")"}} op | digit {print(digit)}
 Construct a syntax-directed translation scheme that translates integers into
 roman numerals.
 
-#### answer
+#### Answer
 
 assistant function:
 
@@ -114,7 +114,7 @@ high -> 5 {high.v = 5}
 
 Construct a syntax-directed translation scheme that trans­ lates roman numerals into integers.
 
-#### answer
+#### Answer
 
 productions:
 
@@ -168,7 +168,7 @@ digit -> smallDigit {digit.v = smallDigit.v}
 Construct a syntax-directed translation scheme that translates postfix
 arithmetic expressions into equivalent prefix arithmetic expressions.
 
-#### answer
+#### Answer
 
 production:
 

ch07/7.2/7.2.md

@@ -8,7 +8,7 @@ Suppose that the program of Fig.7.2 uses a partition function that always picks
 2. What is the largest number of activation records that ever appear together
 on the stack?
 
-#### answer
+#### Answer
 
 1. Draw the activation tree when the numbers 9,8,7,6,5,4,3,2,1 are sorted.
 
@@ -43,7 +43,7 @@ In Fig. 7.9 is C code to compute Fibonacci numbers recur­sively. Suppose that t
 2. What dose the stack and its activation records look like the first time f(1) is about to return?
 3. ! What does the stack and its activation records look like the fifth time f(1) is about to return?
 
-#### answer
+#### Answer
 
 1. Show the complete activation tree. 
 
@@ -73,7 +73,7 @@ That is, function g calls f. Draw the top of the stack, starting with the acti­
 2. Which function writes the value of each element?
 3. To which activation record does the element belong?
 
-#### answer
+#### Answer
 
 ![7 2 4](https://f.cloud.github.com/assets/340282/1267088/836d0550-2ca8-11e3-923d-757450951b13.gif)
 
@@ -88,7 +88,7 @@ In a language that passes parameters by reference, there is a function f(x, y) t
 
 If a is assigned the value 3, and then f(a, a) is called, what is returned? 
 
-#### answer
+#### Answer
 
     x = x + 1  ->  a = a + 1  ->  now a is 4
     y = y + 2  ->  a = a + 2  ->  now a is 6
@@ -109,7 +109,7 @@ The C function f is defined by:
 
 Variable a is a pointer to b; variable b is a pointer to c, and c is an integer currently with value 4. If we call f(c, b, a) , what is returned?
 
-#### answer
+#### Answer
 
 f(c, b, a) is 21
 

ch07/7.3/7.3.md

@@ -25,7 +25,7 @@ In Fig. 7.15 is a ML function main that computes Fibonacci numbers in a nonstand
         
 Figure 7.15: Nested functions computing Fibonacci numbers
 
-#### answer
+#### Answer
 
 activation tree:
 
@@ -39,7 +39,7 @@ activation stack when first call to fib0(1) is about to return:
 
 Suppose that we implement the functions of Fig. 7.15 using a display. Show the display at the moment the first call to fibO(1) is about to return. Also, indicate the saved display entry in each of the activation records on the stack at that time.
 
-#### answer
+#### Answer
 
 ![7 3 2](https://f.cloud.github.com/assets/340282/1274690/d564dbc8-2dc3-11e3-828e-4740db58898d.gif)
 

ch07/7.4/7.4.md

@@ -7,7 +7,7 @@ Suppose the heap consists of seven chunks, starting at address 0. The sizes of t
 1. First fit.   
 2. Best fit.
 
-#### answer
+#### Answer
 
 values in parentheses are sizes actually in use
 

ch07/7.5/7.5.md

@@ -12,7 +12,7 @@ What happens to the reference counts of the objects in Fig. 7.19 if:
 
 Figure 7.19: A network of objects
 
-#### answer
+#### Answer
 
 1. The pointer from A to B is deleted.
 
@@ -37,6 +37,6 @@ What happens to reference counts when the pointer from A to D in Fig. 7.20 is de
 
 Figure 7.20: Another network of objects
 
-#### answer
+#### Answer
 
 ![7 5 2](https://f.cloud.github.com/assets/340282/1276406/eac449f2-2e65-11e3-8e4c-def958552810.gif)

ch07/7.6/7.6.md

@@ -9,7 +9,7 @@ Show the steps of a mark-and-sweep garbage collector on
 3. Fig. 7.20 with the pointer A to D deleted.
 4. Fig. 7.20 with the object B deleted.
 
-#### answer
+#### Answer
 
 1. Fig. 7.19 with the pointer A to B deleted. 
 
@@ -60,7 +60,7 @@ Show the steps of a mark-and-sweep garbage collector on
 
 The Baker mark-and-sweep algorithm moves objects among four lists: Free, Unreached, Unscanned, and Scanned. For each of the object networks of Exercise 7.6.1, indicate for each object the sequence of lists on which it finds itself from just before garbage collection begins until just after it finishes.
 
-#### answer
+#### Answer
 
 1. Fig. 7.19 with the pointer A to B deleted.  
 
@@ -117,7 +117,7 @@ starting at byte 0 of the heap.
 
 What is the address of each object after garbage collection?
 
-#### answer
+#### Answer
 
 1. Fig. 7.19 with the pointer A to B deleted. 
 
@@ -133,7 +133,7 @@ Suppose we execute Cheney's copying garbage collection al­gorithm on each of th
 
 What is the value of NewLocation(o) for each object o that remains after garbage collection?
 
-#### answer
+#### Answer
 
 1. Fig. 7.19 with the pointer A to B deleted. 
 

ch07/7.7/7.7.md

@@ -13,7 +13,7 @@ Suppose that the network of objects from Fig.7.20 is managed by an incremental a
 
 Simulate the entire incremental garbage collection, assuming no more pointers are rewritten. Which objects are garbage? Which objects are placed on the Free list?
 
-#### answer
+#### Answer
 
 
 0. init
@@ -105,7 +105,7 @@ Repeat Exercise 7.7.1 on the assumption that
 2. Events (2) and (5) occur before (1), (3), and (4).
 
 
-#### answer
+#### Answer
 
 
 1. Events (2) and (5) are interchanged in order.
@@ -181,7 +181,7 @@ Repeat Exercise 7.7.1 on the assumption that
 
 Suppose the heap consists of exactly the nine cars on three trains shown in Fig. 7.30 (i.e., ignore the ellipses). Object o in car 11 has references from cars 12, 23, and 32. When we garbage collect car 11, where might o wind up?
 
-#### answer
+#### Answer
 
     if any room in trains 2 and 3
         o can go in some existing car of either trains 2 and 3.
@@ -197,7 +197,7 @@ Repeat Exercise 7.7.3 for the cases that o has
 1. Only references from cars 22 and 31.
 2. No references other than from car 11.
 
-#### answer
+#### Answer
 
 1. Only references from cars 22 and 31.
 
@@ -216,7 +216,7 @@ Repeat Exercise 7.7.3 for the cases that o has
 
 Suppose the heap consists of exactly the nine cars on three trains shown in Fig. 7.30 (i.e., ignore the ellipses). We are currently in panic mode. Object o1 in car 11 has only one reference, from object o2 in car 12. That reference is rewritten. When we garbage collect car 11, what could happen to o1?
 
-#### answer
+#### Answer
 
 It is not important which train we move it to, as long as it is not the first train？
 

ch08/8.2/8.2.md

@@ -26,7 +26,7 @@ Generate code for the following three-address statements assuming all variables
 
 
 
-#### answer
+#### Answer
 
 
 
@@ -124,7 +124,7 @@ Generate code for the following three-address statements assuming a and b are ar
 
 
 
-#### answer
+#### Answer
 
 
 
@@ -192,7 +192,7 @@ Generate code for the following three-address sequence assuming that p and q are
 
 
 
-#### answer
+#### Answer
 
 
 
@@ -232,7 +232,7 @@ Generate code for the following sequence assuming that x, y, and z are in memory
 
 
 
-#### answer
+#### Answer
 
 
 
@@ -284,7 +284,7 @@ Generate code for the following sequence assuming that n is in a memory location
 
 
 
-#### answer
+#### Answer
 
 
 
@@ -414,7 +414,7 @@ Determine the costs of the following instruction sequences:
 
 
 
-#### answer
+#### Answer
 
 
 

ch08/8.3/8.3.md

@@ -14,7 +14,7 @@ return
 return
 ```
 
-#### answer
+#### Answer
 
 ```
 100:  LD SP, #stackStart