Is It Possible To Make Cfg For Infix And Post-fix Expression’s Usin

1.	Is It Possible To Make Cfg For Infix And Post-fix Expression’s Using Derivation Tree ?
Answer» DERIVATION tree is only used to derive WORDS of language that is DESCRIBED by a CFG. YES, we can create CFG for languages infix EXPRESSIONS, postfix expressions. Derivation tree is only used to derive words of language that is described by a CFG. Yes, we can create CFG for languages infix expressions, postfix expressions.

Is It Possible To Make Cfg For Infix And Post-fix Expression’s Using Derivation Tree ?

Answer»

DERIVATION tree is only used to derive WORDS of language that is DESCRIBED by a CFG. YES, we can create CFG for languages infix EXPRESSIONS, postfix expressions.

Derivation tree is only used to derive words of language that is described by a CFG. Yes, we can create CFG for languages infix expressions, postfix expressions.

Discussion

No Comment Found

Related InterviewSolutions

What Is Unit Production?
What Is Meant By The Terms Stack Consistence And Input Tape Consistence ?
What Is Difference Between Push Down Stack And Push Down Store ?
What Is The Uses Of Push Down Automata In Computing ?
Is It Possible To Make Cfg For Infix And Post-fix Expression’s Using Derivation Tree ?
What Is The Difference Between Concatenation And Intersection Of Two Fa’s Also What Is The Difference Among Union Of Two Fa’s And Addition Of Them?
What Are The Productions?
What Does Mean The Language Is Closed?
What Is The Difference Between Derivation Tree And Total Tree ?
What Is The Difference Between Semiword And Word Please Also Give An Example Regarding This?

Is It Possible To Make Cfg For Infix And Post-fix Expression’s Using Derivation Tree ?

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment