From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me
X-Spam-Level: **
X-Spam-Status: No, score=2.1 required=5.0 tests=BAYES_40,INVALID_MSGID,
	REPLYTO_WITHOUT_TO_CC autolearn=no autolearn_force=no version=3.4.4
X-Google-Language: ENGLISH,ASCII-7-bit
X-Google-Thread: 103376,cae702701e24ef29,start
X-Google-Attributes: gid103376,public
From: Sho <Sho@upnaway.com>
Subject: Please read this..thank you
Date: 1997/11/02
Message-ID: <345BBEC0.1D12@upnaway.com>#1/1
X-Deja-AN: 286595650
Organization: Winthrop Technology
Reply-To: Sho@upnaway.com
Newsgroups: comp.lang.ada
Date: 1997-11-02T00:00:00+00:00
List-Id: <comp.lang.ada>


Dear Ada Programmers,

Could you please help me with the algorithms on how to convert Infix to
a Postfix expression? examples:

Infix: 1 + 2 + 3
Postfix: 1 2 3 + +

If anyone has done a program that converts infix to postfix could you
please help me via email or newsgroup? Thank you for your time and
consideration.^_^

Sho