1 / 10

Experim ent 1

Experim ent 1. A genda. Problem description Reverse Polish notation Examples Structure of program Multiple files in a project. Problem description. The problem is to write a calculator program that provides the operators +, -, *and /.

mercedes-horn
Télécharger la présentation

Experim ent 1

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Experiment 1

  2. Agenda • Problem description • Reverse Polish notation • Examples • Structure of program • Multiple files in a project

  3. Problem description • The problem is to write a calculator program that provides the operators +, -, *and /. • The calculator will use reverse Polish notation instead of infix. Because it is easier to implement.

  4. Reverse polish notation • Reverse Polish notation (RPN) is a mathematical notation in which every operator follows all of its operands. • The description "Polish" refers to the nationality of logician Jan Łukasiewicz, who invented (prefix) Polish notation in the 1920s.

  5. Examples(1/3) • In reverse Polish notation the operators follow their operands; • to add 3 and 4, one would write "3 4 +" rather than "3 + 4". • If there are multiple operations, the operator is given immediately after its second operand; • "3 − 4 + 5" in conventional notation would be written "3 4 − 5 +" in RPN:

  6. Examples(2/3) • RPN does not need parentheses that are required by infix.  • “3 − 4 × 5” would be written as “3 4 5 × −” • “( 3 − 4 ) × 5” would be written as “3 4 - 5 × ”

  7. Algorithm • While there are input tokens (operators or operand) left • Read the next token from input. • If the token is a operand • Push it onto the stack. • Otherwise, the token is an operator： • It is known a priori that the operator takes n arguments. • If there are fewer than n values on the stack • (Error) The user has not input sufficient values in the expression. • Else, Pop the top n values from the stack. • Evaluate the operator, with the values as arguments. • Push the returned results, if any, back onto the stack. • If there is only one value in the stack • That value is the result of the calculation. • Otherwise, there are more values in the stack • (Error) The user input has too many values.

  8. Example(3/3) The infix expression "5 + ((1 + 2) × 4) − 3" can be written down like this in RPN: 5 1 2 + 4 × + 3 −

  9. Structure of program • 4 source files and 1 head file: • calc.h contains declarations of global functions (external variable) and macro definitions • main.ccontains main function • stack.ccontains push/pop functions of stack • getop.ccontains getop() for fetching the next input token(opeator/operand) • getch.ccontains get a next character or push character back on input

More Related