Anyone can help me in this COMPILER CONSTRUCTION QUESTION??? Consider the grammar
SS+S|S-S|S*S|S/S|S^S|(S) |id
Removing ambiguity, recursion and factored where ever possible
Draw parse tree
(id-(id/(id^id)))

Explanation:

Context Free Grammars(CFGs) are classified based on:

Depending on Number of Derivation trees, CFGs are sub-divided into 2 types:

Ambiguous grammar:

A CFG is said to ambiguous if there exists more than one derivation tree for the given input string i.e., more than one LeftMost Derivation Tree (LMDT) or RightMost Derivation Tree (RMDT).

Definition: G = (V,T,P,S) is a CFG is said to be ambiguous if and only if there exist a string in T* that has more than on parse tree.

where V is a finite set of variables.

T is a finite set of terminals.

P is a finite set of productions of the form, A -> α, where A is a variable and α ∈ (V ∪ T)* S is a designated variable called the start symbol.

1. entrepreneur.com

2. wikipedia