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

 0    8 flashcards    up804653
download mp3 print play test yourself
 
Question English
Answer English

What is parsing?
start learning
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?
start learning
the placement of operators between operands—"infixed operators"—such as the plus sign in 2 + 2.

what is postfix notation?
start learning
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?
start learning
+ 2 2

what are the two methods to convert from infix to post fix notation
start learning
Using Dijkstra’s Algorithm or Drawing an Expression Tree / Parse Tree

what is an Expression Tree / Parse Tree?
start learning
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?
start learning
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?
start learning
Open bracket (0 - lowest Addition and Subtraction 1 Multiplication and Division 2 Raise to the power 3 – highest


You must sign in to write a comment