Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

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

NotificationsYou 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

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 theexample.js file
  3. Runexample.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

[8]ページ先頭

©2009-2025 Movatter.jp