Skip to main content

Syntax Trees

Syntax trees are abstract or compact representation of parse trees.

They are also called as Abstract Syntax Trees.

Example-



Problem-01:

Considering the following grammar-

E → E + T | T
T → T x F | F
F → ( E ) | id
Generate the following for the string id + id x id
  1. Parse tree
  2. Syntax tree
  3. Directed Acyclic Graph (DAG)

Solution-

Parse Tree-


 





Comments

Post a Comment

Popular posts from this blog

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- Eliminating the unwanted code lines Rearranging the statements of the code Advantages- The optimized code has the following advantages- Optimized code has faster execution speed. Optimized code utilizes the memory efficiently. Optimized code gives better performance. Code Optimization Techniques- Important code optimization techniques are- Compile Time Evaluation Common sub-expression elimination Dead Code Elimination Code Movement Strength Reduction 1. Compile Time Evaluation- Two techniques that falls under compile time evaluation are- A) Constant Folding- In this technique, As the name suggests, it involves folding the constants. The expressions that contain the operands having constant values at compile time are evaluated. Those express...
Post a Comment
Read more

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 combination of both. Rest of the derivation is added by new productions. The grammar obtained after the process of left factoring is called as Left Factored Grammar . Example-   PRACTICE PROBLEMS BASED ON LEFT FACTORING- Problem-01: Do left factoring in the following grammar- S → iEtS / iEtSeS / a E → b Solution- The left factored grammar is- S → iEtSS’ / a S’ → eS / ∈ E → b Problem-02: Do left factoring in the following grammar- A → aAB / aBc / aAc Solution- Step-01: A → aA’ A’ → AB / Bc / Ac Again, this is a grammar with common prefixes. Step-02: A → aA’ A’ → AD / Bc D → B / c This is a left factored grammar. Problem-03: Do left factoring in the following grammar- S → bSSaaS / bSSaSb / bSb / a Solution- ...
Post a Comment
Read more

Ambiguous Grammar | Grammar in Automata

Before you go through this article, make sure that you have gone through the previous article on Types of Grammar in Automata. On the basis of number of derivation trees, grammars are classified as- Ambiguous Grammar Unambiguous Grammar 1. Ambiguous Grammar- A grammar is said to ambiguous if for any string generated by it, it produces more than one- Parse tree Or derivation tree Or syntax tree Or leftmost derivation Or rightmost derivation Example- Consider the following grammar- E → E + E / E x E / id Ambiguous Grammar This grammar is an example of ambiguous grammar. Any of the following reasons can be stated to prove the grammar ambiguous- Reason-01: Let us consider a string w generated by the grammar- w = id + id x id Now, let us draw the parse trees for this string w. Since two parse trees exist for string w, therefore the grammar is ambiguous. Reason-02: Let us ...
Post a Comment
Read more