Code Optimization | Code Optimization Techniques
Code Optimization- Code Optimization is an approach to enhance the performance of the code. The process of code optimization involves-...
top of page
Search
Three Address Code | Examples
Three Address Code- Three Address Code is a form of an intermediate code. The characteristics of Three Address instructions are- They are...
Grammar Ambiguity | Check Ambiguous Grammar
Grammar Ambiguity- Before you go through this article, make sure that you have gone through the previous article on Ambiguous Grammar....
Ambiguous Grammar | Grammar in Automata
Before you go through this article, make sure that you have gone through the previous article onTypes of Grammarin Automata. On the basis...
Grammar in Automata | Types of Grammar
Grammar in Automata- Formal Definition- A Grammar is a 4-tuple such that G = (V , T , P , S) where- V = Finite non-empty set of...
Parse Tree | Derivations
Parse Tree- The process of deriving a string is called as derivation. The geometrical representation of a derivation is called as a parse...
Testing a Program – An Example
Question: Write a set of test cases – specific set of data – to properly test a relatively Simple program. Create a set of test data for...
Syntax Trees
Syntax trees are abstract or compact representation of parse trees. They are also called as Abstract Syntax Trees. Example- Problem-01:...
Elimination of Left Factoring
In left factoring, We make one production for each common prefixes. The common prefix may be a terminal or a non-terminal or a...
FIRST & FOLLOW Calculation
First Function- First(α) is a set of terminal symbols that begin in strings derived from α. Example- Consider the production rule- A →...
Elimination of left recursion
1. Left Recursion- A production of grammar is said to have left recursion if the leftmost variable of its RHS is same as variable of its...
Blog: Blog2
bottom of page