https://github.com/oiricaud/infixtopostfix
Write a program that, given an arithmetic expression, first transforms it to a postfix form, and then computes its value (by using the stack-based algorithms that we recalled in class).
https://github.com/oiricaud/infixtopostfix
automata infix-notation postfix
Last synced: 4 months ago
JSON representation
Write a program that, given an arithmetic expression, first transforms it to a postfix form, and then computes its value (by using the stack-based algorithms that we recalled in class).
- Host: GitHub
- URL: https://github.com/oiricaud/infixtopostfix
- Owner: oiricaud
- Created: 2016-11-10T00:18:50.000Z (about 9 years ago)
- Default Branch: master
- Last Pushed: 2016-11-10T00:20:43.000Z (about 9 years ago)
- Last Synced: 2025-03-11T02:37:44.429Z (10 months ago)
- Topics: automata, infix-notation, postfix
- Language: Java
- Size: 6.84 KB
- Stars: 1
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files: