This repl is an implementation of an algorithm to convert from infix to postfix notation with Python.
From the shell, simply run python main.py. The output should be the infix array that separates the string into tokens and then a row with the postfix array.
Edit the main.py file to modify the algorithm. You can change the expression that gets postfixed or ideally make it accept user inputs.
Also try to add support for more expressions, make the code faster/better, or more Pythonic. The code is mostly just JS code rewritten to satisfy Python syntax.