Compilation Techniques Notes

Top down parsing

character after the first character in the terminal values
<h2>Algorithm</h2>
<ol>
<li>If S is the start symbol,
ex: S -> Ab | c, then $ is the Follow value of S</li>
<li>If A -> αBβ, then all First of β is the Follow of B except ε</li>
<li>a. A -> αB, then all Follow of A is the Follow of B</li>
<li>b. A -> αBβ and First of β is ε, then all Follow of A is the Follow of B</li>
</ol>
<blockquote>
You can only find the follow values of the terminal on the lines before it
</blockquote>
<blockquote>
You can use this algorithm or a cheat method by looking at the result of the production, and find the terminal value after the terminal
</blockquote>
<h2>Cheat</h2>
Ex:
Abc = b 
A + b = + 
ADE = ...
Status: #idea 
Tags: <a href="../compilation-techniques" class="internal-link">compilation-techniques</a><html><head></head><body><span class="note-preview block col-span-2 max-w-[400px] rounded shadow-sm p-5 bg-white dark:bg-gray-800 cursor-pointer text-lg text-black dark:text-white hover:bg-gray-200 dark:hover:bg-gray-700 hover:border-transparent">Compilation Techniques Notes* [ ] Assigments

RE to DFA

Example Kenny Jingga CT UTS Quiz

kennydfa1.png

kennydfa2.png

kennydfa3.png

Example Ivan Sebastian CT UTS Quiz

RE to E-NFA to DFA

Example Kenny Jingga CT UTS Quiz

kenny1.png

Example Ivan Sebastian CT UTS Quiz

ivan2.png WRONGGGG

Context Free Grammar

Top down parsing

Example Alvina Aulia Top Down Parsing

1. E -> TE'
1. E' -> +TE' | ε
1. T -> FT'
1. T' -> \FT'* | ε
1. F -> (E) | id

First Values:

1. First E = (, id (this is from E -> T -> F)
1. First E' =</body></html>
<hr>
<h1>References</h1>