|
1
|
|
|
|
Finding First & Follow Sets
|
|
|
2 listeners
|
|
2
|
|
|
|
Case Statements
|
|
|
1 listener
|
|
3
|
|
|
|
Backpatching
|
|
|
1 listener
|
|
4
|
|
|
|
Boolean Expressions
|
|
|
1 listener
|
|
5
|
|
|
|
Flow of Control Statements
|
|
|
1 listener
|
|
6
|
|
|
|
RE to DFA by Direct Method
|
|
|
1 listener
|
|
7
|
|
|
|
Why study and Introduction
|
|
|
1 listener
|
|
8
|
|
|
|
Leading and Trailing in Operator Precedence Parsing
|
|
|
1 listener
|
|
9
|
|
|
|
Yacc Program to recognize arithmetic expression
|
|
|
1 listener
|
|
10
|
|
|
|
Implementation of Three Address Statements
|
|
|
1 listener
|
|
11
|
|
|
|
SDT to convert infix to postfix expression
|
|
|
1 listener
|
|
12
|
|
|
|
SDT to produce Three Address Code
|
|
|
1 listener
|
|
13
|
|
|
|
SDT to build Syntax Tree
|
|
|
1 listener
|
|
14
|
|
|
|
Declarations
|
|
|
1 listener
|
|
15
|
|
|
|
Basic Blocks and Flow Graphs
|
|
|
1 listener
|
|
16
|
|
|
|
Storage Allocation Strategies
|
|
|
1 listener
|
|
17
|
|
|
|
Elimination of Left Recursion
|
|
|
1 listener
|
|
18
|
|
|
|
Left Factoring
|
|
|
1 listener
|
|
19
|
|
|
|
FIRST and FOLLOW Functions
|
|
|
1 listener
|
|
20
|
|
|
|
Issues in the design of code generator
|
|
|
1 listener
|
|
21
|
|
|
|
The Target Machine
|
|
|
1 listener
|
|
22
|
|
|
|
Boolean Expression (Control Flow Translation)
|
|
|
1 listener
|