→ Week 11 Workshop 8 Hierarchical Data Structures Part 2 – Application: Expression Trees → Öğrenmeye Başla / MP3 Flashcards indir

soru		cevap
What is parsing? öğrenmeye başla		Arithmetic expressions are converted into an (equivalent) unique form. Compliers must generate unambiguous code in which one operation is executed at a time.
what is infix notation? öğrenmeye başla		the placement of operators between operands—"infixed operators"—such as the plus sign in 2 + 2.
what is postfix notation? öğrenmeye başla		arithmetic expressions in which the operands appear before their operators. This notation is used in Complier design to generate our unambiguous code eg 2 2 +
what is prefix notation? öğrenmeye başla		+ 2 2
what are the two methods to convert from infix to post fix notation öğrenmeye başla		Using Dijkstra’s Algorithm or Drawing an Expression Tree / Parse Tree
what is an Expression Tree / Parse Tree? öğrenmeye başla		Write the expression out as a BST then navigate it using pre or post order traversal to achive the corrected output
what is Dijkstra’s Algorithm? öğrenmeye başla		Work through infix expression from left to right Operands are output immediately. Operators are stored in a stack until required
what are the precedences for dijkstras algorithm? öğrenmeye başla		Open bracket (0 - lowest Addition and Subtraction 1 Multiplication and Division 2 Raise to the power 3 – highest

week 11 Workshop 8 Hierarchical Data Structures Part 2 – Application: Expression Trees