From 400669726b375271d80f3fb2cb85519809ce40b1 Mon Sep 17 00:00:00 2001
From: Chris O'Brien <obrienc2@wit.edu>
Date: Mon, 16 Jul 2012 08:34:45 -0400
Subject: [PATCH 1/3] Changed # in headers so they have they cascade according
 to its subtype

---
 textbook/05-semantic-analysis.md | 52 ++++++++++++++++----------------
 1 file changed, 26 insertions(+), 26 deletions(-)

diff --git a/textbook/05-semantic-analysis.md b/textbook/05-semantic-analysis.md
index 06fa44e..fbe940d 100644
--- a/textbook/05-semantic-analysis.md
+++ b/textbook/05-semantic-analysis.md
@@ -51,7 +51,7 @@ TOPICS:
 Semantic Analysis
 =================
 
-### What is semantics?
+### What are semantics?
     <!---
     4.1 Overview
     -->
@@ -61,7 +61,7 @@ It does so by evaluating the meaning of syntactically legal strings defined by a
 In such a case that the evaluation would be of syntactically illegal strings, the result would be non-computation.
 Semantics describes the processes a computer follows when executing a program in that specific language.
 
-###
+#### How does this work with the Parse Tree?
     <!---
 	4.1.1 Relation to Parse Tree
     -->
@@ -69,19 +69,19 @@ Semantics describes the processes a computer follows when executing a program in
 The Parse Tree is the means by which multi stage compilers check the semantics of a program in a nonlinear fashion.
 Additional a symbol table is added to the Parse Tree during the semantic analysis.
 
-###
+##### What Input is recieved from the parser?
     <!---
     4.1.1.1 Input from Parser
     -->
 
 
 
-### What are static semantics?
+##### What are static semantics?
     <!---
     4.1.1.2 Adds Semantic Information to Parse Tree
-    -->
 
-### 
+    -->
+#### 
     <!---
 	4.1.2 Output to Code Generation Phase
     -->
@@ -91,102 +91,102 @@ Additional a symbol table is added to the Parse Tree during the semantic analysi
 	4.2 Process
     -->
 
-###
+####
     <!---
 	4.2.1 Type Checking
     -->
 
-###
+#####
     <!---
 	4.2.1.1 Verify Type Constraints
     -->
 
-###
+#####
     <!---
 	4.2.1.2 Static Checking
     -->
 
-###
+######
     <!---
 	4.2.1.2.1 Done at Compile Time
     -->
 
-###
+######
     <!---
 	4.2.1.2.2 Dynamic Checking Done at Runtime
     -->
 
-###
+######
     <!---
 	4.2.1.2.3 Example Languages
     -->
 
-###
+#######
     <!---
 	4.2.1.2.3.1 Ada
     -->
 
-###
+#######
     <!---
 	4.2.1.2.3.2 C++
     -->
 
-###
+#######
     <!---
 	4.2.1.2.3.3 Java
     -->
 
-###
+#####
     <!---
 	4.2.1.3 Type Safety
     -->
 
-###
+#####
     <!---
 	4.2.1.4 Types Specified by the Language Specification
     -->
 
-###
+####
     <!---
 	4.2.2 Object Binding
     -->
 
-###
+#####
     <!---
 	4.2.2.1 Associates Variable with its Definition
     -->
 
-###
+#####
     <!---
 	4.2.2.2 Resolve Object References
     -->
 
-###
+####
     <!---
 	4.2.3 Assignment Operations
     -->
 
-###
+#####
     <!---
 	4.2.3.1 Data Flow Analysis
     -->
 
-###
+#####
     <!---
 	4.2.3.2 Definite Assignment Analysis
     -->
 
-###
+######
     <!---
 	4.2.3.2.1 Ensures Variable are Assigned Before Used
     -->
 
-###
+######
     <!---
 	4.2.3.2.2 Allows Potential Optimization
     -->
 
-###
+####
     <!---
 	4.2.4 Produce Errors/Warnings
 	-->

From afdfadc22d7dda33f6d960e337fc41c7da3a4600 Mon Sep 17 00:00:00 2001
From: Chris O'Brien <obrienc2@wit.edu>
Date: Fri, 10 Aug 2012 12:55:06 -0400
Subject: [PATCH 2/3] added stuff to chapter 3

---
 textbook/03-parsing.md           | 4 ++++
 textbook/05-semantic-analysis.md | 7 ++++---
 2 files changed, 8 insertions(+), 3 deletions(-)

diff --git a/textbook/03-parsing.md b/textbook/03-parsing.md
index 78b10e6..b2644bc 100644
--- a/textbook/03-parsing.md
+++ b/textbook/03-parsing.md
@@ -97,15 +97,19 @@ Thus, it is impossible to construct a regular expression (but possible to constr
 Give examples.
 
 ### What is a leftmost derivation?
+The leftmost derivation is the always the leftmost nonterminal.
 
 ### What is a rightmost derivation?
+The rightmost derivation is always the rightmost nonterminal.
 
 ### What is an ambiguous grammar?
 
 ### What is a LL(k) grammar?
+LL(k) grammar allows parsing by direct construction of a leftmost derivation, and describe even fewer languages.
 
 ### What is a LR(k) grammar?
 
+
 ### What is Backus-Naur Form?
 
 A BNF specification is a set of derivation rules, written as
diff --git a/textbook/05-semantic-analysis.md b/textbook/05-semantic-analysis.md
index fbe940d..ec6aa51 100644
--- a/textbook/05-semantic-analysis.md
+++ b/textbook/05-semantic-analysis.md
@@ -67,7 +67,7 @@ Semantics describes the processes a computer follows when executing a program in
     -->
 
 The Parse Tree is the means by which multi stage compilers check the semantics of a program in a nonlinear fashion.
-Additional a symbol table is added to the Parse Tree during the semantic analysis.
+Additionally a symbol table is added to the Parse Tree during the semantic analysis.
 
 ##### What Input is recieved from the parser?
     <!---
@@ -76,11 +76,12 @@ Additional a symbol table is added to the Parse Tree during the semantic analysi
 
 
 
-##### What are static semantics?
+#####
     <!---
     4.1.1.2 Adds Semantic Information to Parse Tree
-
     -->
+	
+	
 #### 
     <!---
 	4.1.2 Output to Code Generation Phase

From d6d35a8351f2ec59f369168ecc6e8ded68eb652b Mon Sep 17 00:00:00 2001
From: Chris O'Brien <obrienc2@wit.edu>
Date: Fri, 10 Aug 2012 13:06:20 -0400
Subject: [PATCH 3/3] added PDA stuff

---
 textbook/03-parsing.md | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/textbook/03-parsing.md b/textbook/03-parsing.md
index b2644bc..a826f1d 100644
--- a/textbook/03-parsing.md
+++ b/textbook/03-parsing.md
@@ -108,7 +108,7 @@ The rightmost derivation is always the rightmost nonterminal.
 LL(k) grammar allows parsing by direct construction of a leftmost derivation, and describe even fewer languages.
 
 ### What is a LR(k) grammar?
-
+LR(k)grammar (also known as deterministic context-free grammar) allows parsing with deterministic pushdown automata, but they can only describe deterministic context-free languages.
 
 ### What is Backus-Naur Form?
 
@@ -131,8 +131,10 @@ It manipulates a stack by choosing an indexing variable within the stack, a curr
 > TODO: It'd be nice to have a picture of a pushdown automaton, in a vector format such as SVG.
 
 ### What is a deterministic pushdown automaton?
+A determinisitic pushdown automaton is any pushdown automaton that is fully determined rather than one that has a decision to make between multiple options. As a result of everything being determined all future states can be fully predicted.
 
 ### What is a nondeterministic pushdown automaton?
+A nondeterministic pushdown automaton is any automaton which is not deteriministic. As a result it has at least 2 options which may or may not be mutually exclusive. These pushdown automaton can also handle all context free grammers.
 
 ### What is a parser?
 A parser: