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

 0    8 tarjetas    up804653
descargar mp3 imprimir jugar test de práctica
 
término English
definición English

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

what is postfix notation?
empezar lección
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?
empezar lección
+ 2 2

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

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


Debes iniciar sesión para poder comentar.