Learning objective
Reverse Polish – infix transformations: Be able to convert simple expressions in infix form to Reverse Polish notation (RPN) form and vice versa. Be aware of why and where it is used. Eliminates need for brackets in sub- expressions. Expressions in a form suitable for evaluation using a stack. Used in interpreters based on a stack for example Postscript and bytecode. 52
Read the explanation, check the common trap, then practise with flashcards and questions.
At a glance
0
Flashcards
0
Questions
Topic
Reverse Polish
Subtopic
Reverse Polish – infix transformations
Aqa A Level Computer ScienceFundamentals of algorithms
Study support
Understand this objective
Quick explanation
Reverse Polish – infix transformations: Be able to convert simple expressions in infix form to Reverse Polish notation (RPN) form and vice versa. Be aware of why and where it is used. Eliminates need for brackets in sub- expressions. Expressions in a form suitable for evaluation using a stack. Used in interpreters based on a stack for example Postscript and bytecode. 52
- This point belongs to Reverse Polish, especially Reverse Polish – infix transformations.
- You need to be able to reverse Polish – infix transformations: Be able to convert simple expressions in infix form to Reverse Polish notation (RPN) form and vice versa. Be aware of why and where it is used. Eliminates need for brackets in sub- expressions. Expressions in a form suitable for evaluation using a stack. Used in interpreters based on a stack for example Postscript and bytecode. 52.
- Use the linked flashcards and practice questions to check recall, then practise applying the idea in an exam-style answer.
Why it matters
This objective helps connect Reverse Polish – infix transformations to exam-style questions, flashcards, and revision notes for Reverse Polish.
Quick student answer
What is the Reverse Polish notation (RPN) form of the infix expression A + B * C?
Direct answer
ABC*+
Key terms
- Reverse Polish notation (RPN): A form of expression in which operators are written after the operands they use.
- Stack-based interpreter: An interpreter that evaluates expressions using a stack to store operands and intermediate results.
Common trap
Placing an operator before its operands: Place the operator after its operands: A+B becomes AB+.
Related questions
Try this as a practice card
Question 1 of 4
Choose an answer, get feedback, then move sideways through the set.
0 of 4 attempted
Flashcard prompts
Flip through the key recall cards
Flashcard 1 of 4
Press Space to flip, arrows to move
Revision tools
Choose how to practise
Flashcards0 linked cards
No objective-specific flashcards are cached for this page. Use the topic hub to revise the surrounding flashcards without triggering a frozen-subject DB fallback.Open topic hub
Practice Questions0 linked questions
No objective-specific practice questions are cached for this page. Use the topic question bank to practise nearby curriculum questions without weakening the egress guard.Open topic questions
Related learning objectives
No linked resources are published for this section yet.