Python code Use input data from input file Output the results in an output file You will use recursion to convert prefix expressions directly to postfix expressions. You may not use a stack as you did in Lab 1. Write a program that accepts a prefix expression containing single letter operands and the operators +, -, *, /, and $ (representing exponentiation). Output the corresponding postfix epression. Be sure to discuss why recursion makes sense. For example, if your input is *AB then output should be AB*. Output of BA* is considered incorrect. Required input file: -+ABC -A+BC $+-ABC+D-EF -*A$B+C-DE*EF **A+BC+C-BA /A+BC +C*BA *-*-ABC+BA /+/A-BC-BA *$A+BC+C-BA //A+B0-C+BA *$A^BC+C-BA Output file should produce for: Prefix = -+ABC AB+C- or Prefix = -A+BC ABC+- or Prefix = $+-ABC+D-EF $+-ABC+D-EF Thanks!
Python code
Use input data from input file
Output the results in an output file
You will use recursion to convert prefix expressions directly to postfix expressions. You may not use a stack as you did in Lab 1.
Write a program that accepts a prefix expression containing single letter operands and the operators +, -, *, /, and $ (representing exponentiation). Output the corresponding postfix epression. Be sure to discuss why recursion makes sense.
For example, if your input is *AB then output should be AB*. Output of BA* is considered incorrect.
Required input file:
-+ABC
-A+BC
$+-ABC+D-EF
-*A$B+C-DE*EF
**A+BC+C-BA
/A+BC +C*BA
*-*-ABC+BA
/+/A-BC-BA
*$A+BC+C-BA
//A+B0-C+BA
*$A^BC+C-BA
Output file should produce for:
Prefix = -+ABC
AB+C-
or
Prefix = -A+BC
ABC+-
or Prefix = $+-ABC+D-EF
$+-ABC+D-EF
Thanks!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
