Compiler Design and Construc3on
(CS 5900)
Lecture 9
Dr. Taiabul Haque
Assistant Professor
University of Central Missouri
Removing ambiguity
We need to rewrite the rules in unambiguous way
No algorithm exists, ne

Compiler Design and Construc3on
(CS 5900)
Lecture 7
Dr. Taiabul Haque
Assistant Professor
University of Central Missouri
Course Objec3ves/ Learning Outcomes
Understand the basic concepts of formal language, includ

Dr. D.M. Akbar Hussain
Compiler Construction
Text Book:
Compiler Construction: Principles and Practice
By: Kenneth C. Louden
(San Jose State University, USA)
Book can be used for background reading.
Book can also be used for your personal lecture
preparat

Compiler Design and Construc3on
(CS 5900)
Lecture 8
Dr. Taiabul Haque
Assistant Professor
University of Central Missouri
Parse tree
We saw parse tree previously, now lets explore it in
more detail
Par

Compiler Design and Construction
(CS 5900)
Lecture 10
Dr. Taiabul Haque
Assistant Professor
University of Central Missouri
Top-down parsing
A top-down parsing algorithm parses an input
from root to the leaves
Two types: recursive descent and LL (1)
pars

Compiler Design and Construc3on
(CS 5900)
Lecture 5
Dr. Taiabul Haque
Assistant Professor
University of Central Missouri
DFA examples
The set of strings that contain exactly
one b
DFA examples
The set of

Compiler Design and Construc3on
(CS 5900)
Lecture 6
Dr. Taiabul Haque
Assistant Professor
University of Central Missouri
Regular expression, DFA, and NFA
Three concepts closely related to one another
DFA is a

CS5300: Advanced Algorithms and Data Structures
Instructor: Dr. Yui Man Lui
Office: CSC 133E
Phone: 660-543-6615
Email: [email protected]
(Put the subject line with CS5300 and I will try to get back to you within 24 hours.)
Office Hours:
Tuesday (4:00pm 6:00pm

2/3/16
Advanced
Algorithms and Data Structures
Algorithms and Data Structures
Quicksort)
Instructor: Dr. Yui Man Lui
1
2/3/16
Quicksort
Standard func=on in Unix and C (qsort)
In-place sor=ng
Divide and Conquer
Pivot is a selected value

1) Watch: https:/www.youtube.com/watch?v=moPtwq_cVH8
Write a one-page summary
2) TSP Problem: Given a list of cities and distances between each pair of cities,
determine the shortest possible route that one needs to visit each city exactly one
and

1. Consider the following pseudo-code described below.
int* Algo(int *data, int l, int n)
cfw_
if (n>1) cfw_
int m=n/2;
x1 = Algo(data, l, m);
x2 = Algo(data, m+1, n);
Compute(x1, x2, n);
return x1;
void Compute(int* data1, int *data2, int n)
cfw_
if (

Practical Session #2 - Recursions
Substitution
method
Guess the form of the solution and prove it by induction
Iteration Method
Convert the recurrence into a summation and solve it
Master Method
Bound a recurrence of the form:
T(n) = aT(n/b) + f(n) a 1 ,

Name: Manojkumar Velama
ID:700648171
Email:[email protected]
1.Summary of computational complexity:
The time complexity is all about taking the decision in problem solving. Some problems we can solve in
polynomial time and some others in exponential time

1) Use loop invariant to show the correctness of the partition algorithm
in quicksort.
2) Exercise 7.4-2
3) Exercise 9.3-1
4) Exercise 11.2-1
5) Problem 11.1
6) Perform a union operation on the following binomial heaps
Heap A: