An Effective Conversion Algorithm of Arithmetic Expression from Infix Form to Prefix Form

Generally, when we optimize the object code of expression in source program, we get the optimizing code in the binary tree of this expression. Expressions in source program are in infix form, while the prefix form is more efficient for the binary tree. Hence this paper is to provide an effective tra...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Applied Mechanics and Materials 2011-06, Vol.58-60, p.1350-1353
Hauptverfasser:	Wang, Ting, Liu, Ren Ren, Tan, Hao Xun
Format:	Artikel
Sprache:	eng
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!