Skip to content

This is a simple infix to postfix converter written in JavaScript. It is a simple project that I made to show other students how they can easily design this type of program and how they can use it to solve their problems.

License

Notifications You must be signed in to change notification settings

BaseMax/Infix2Postfix

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

16 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Infix To Postfix Converter (Infix2Postfix)

This is a simple infix to postfix converter written in JavaScript.

It is a simple project that I made to show other students how they can easily design this type of program and how they can use it to solve their problems.

How to use

  1. Clone the repository
  2. Enter your infix expression in the example.js file
  3. Run example.js in your terminal
  4. You will get the postfix expression as output

Example

convert_infix_to_postfix("5 + 6 * 7")
// [ '5', '6', '7', '*', '+' ]

convert_infix_to_postfix("(((a/b)-c) + (d*e))- (a*c)")
// [
//   'a', 'b', '/', 'c',
//   '-', 'd', 'e', '*',
//   '+', 'a', 'c', '*',
//   '-'
// ]

convert_infix_to_postfix("(k+l)-(m*n)+(o^p)*w/v/u*t+q")
// [
//   'k', 'l', '+', 'm', 'n',
//   '*', '-', 'o', 'p', '^',
//   'w', '*', 'v', '/', 'u',
//   '/', 't', '*', '+', 'q',
//   '+'
// ]

© Copyright (c) 2022 Max Base

About

This is a simple infix to postfix converter written in JavaScript. It is a simple project that I made to show other students how they can easily design this type of program and how they can use it to solve their problems.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published