Research indexJournal article
CONVERTING INFIX NOTATION TO POSTFIX NOTATION USING STACK APPLICATION IN DATA STRUCTURE
Arianty
Jurnal Ilmiah Informatika Komputer18 Nov 2009
NobleIDark:/48914/w1/20260515/95B40B79DOI10.35760/ik.2008.v13i3.67.g65
CONVERTING INFIX NOTATION TO POSTFIX NOTATION USING STACK APPLICATION IN DATA STRUCTURE
Arianty · Jurnal Ilmiah Informatika Komputer · 2009 · Subscription
NobleIDark:/48914/w1/20260515/95B40B79DOI10.35760/ik.2008.v13i3.67.g65
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
The use of stack becomes a common issue for memory address assignment, placement in data space, and other applications. As a part of data structure, stack application is also used for different needs, such as matching parentheses and conversion from Infix notation into Postfix. This paper was written to provide approach in the conversion process form Infix to Postfix in arithmetics. Keyword(s): Arithmetic, Infox notation, Postfix notation, Stack, Data structure. Subject Description : E.Data | E.1.Data Structures | Lists, stacks and query