This week's book giveaways are in the AI and JavaScript forums.
We're giving away four copies each of GANs in Action and WebAssembly in Action and have the authors on-line!
See this thread and this one for details.
Win a copy of GANs in ActionE this week in the AI forum
or WebAssembly in Action in the JavaScript forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Bear Bibeault
  • Paul Clapham
  • Jeanne Boyarsky
  • Knute Snortum
Sheriffs:
  • Liutauras Vilda
  • Tim Cooke
  • Junilu Lacar
Saloon Keepers:
  • Ron McLeod
  • Stephan van Hulst
  • Tim Moores
  • Tim Holloway
  • Carey Brown
Bartenders:
  • Joe Ess
  • salvin francis
  • fred rosenberger

converting a postfix to an infix

 
Greenhorn
Posts: 24
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Hi everyone!!! i stumbled upon another problem... i was searching online for information about converting postfix to infix notation... i think i got the infix to postfix now... but i just can't get enough information on how to convert postfix notation to infix notation... i don't even know the algorithm or pseudocode.... can't find online... all i could find was infix to postfix...
can anyone please help me???
like a good reading material about the topic, or a sample code, or a good source... i tried yahoo... but couldn't find any... and even on google... i've been online for a few hours now... *sigh!*
Thank you very much!!!
 
Bartender
Posts: 2700
IntelliJ IDE Opera
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
First hit on google: link. Looks clear to me.

 
Ranch Hand
Posts: 61
Eclipse IDE Java
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator

Wouter Oet wrote:First hit on google: link. Looks clear to me.



The link that you've posted here gives algo for infix to postfix only.
What Momo has asked for is the reverse process... I guess the following link contains the answer:
here
 
Wouter Oet
Bartender
Posts: 2700
IntelliJ IDE Opera
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
True but I figured that if you know the algorithm one way then it's doable to reverse it.
 
Momo Sawada
Greenhorn
Posts: 24
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
i don't know what to do with my code.... lol..
i think i read the algorithm... i tried..(and i think failed) in making what i would like to do...

here goes...

 
Greenhorn
Posts: 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
You can refer the "data structures by lipschutz and seymour" for algorithm.

A very good book for data structures. Once you understand the algorithm, it should be easy to implement.
 
Marshal
Posts: 67410
257
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
Welcome to the Ranch Only 2½ years for your first post.
 
Momo Sawada
Greenhorn
Posts: 24
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
hahaha... yeah..
and thanks... i've finally done with it a few days ago...(sorry for my late reply...)
and thank you to all who replied here!!! i really appreciate it!!!
 
Popeye has his spinach. I have this tiny ad:
Java file APIs (DOC, XLS, PDF, and many more)
https://products.aspose.com/total/java
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
Boost this thread!