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

Ting Wang; Hao Xun Tan; Ren Ren Liu

doi:10.4028/www.scientific.net/AMM.58-60.1350

Paper Titles

STRIDE – Based Risk Assessment for Web Application
p.1323

Image-Based Simulation for Snowy Scenes
p.1329

A Primary Study on the Relationship between Internet Involvement and Adolescents’ Mental Health
p.1336

Thermal Wave Image Reconstruction of Bonding Defects in Missile Engine Shell
p.1344

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

A Scheme of H.264 HD Encoding/Transcoding System Based on ASIC
p.1354

The Study of Academic Research Level Appraisal Method Based on both ANP and Factor Analysis
p.1359

The Study of Moving Images Track Recording System which Based on Mean Shift Algorithm
p.1365

A GA-BP Neural Network Model for Predicting the Temperature of Slabs in the Reheating Furnace
p.1371

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 58-60An Effective Conversion Algorithm of Arithmetic...

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

Abstract:

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 transition algorithm of arithmetic expression from infix form to prefix form.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 58-60)

Pages:

1350-1353

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.58-60.1350

Citation:

Cite this paper

Online since:

June 2011

Authors:

Ting Wang, Hao Xun Tan, Ren Ren Liu

Keywords:

Algorithm (GA), Code, Compiler, Object, Optimise

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman. Compilers: Principles, Techniques and Tools (2nd Edition), Addison Wesley (2006).

Google Scholar

[2] Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms, Pearson Education ( 2003).

Google Scholar

[3] Jiang,D., Tang, C., and Zhang A. Cluster analysis for gene expression data: a survey. IEEE Trasactions on Knowledge and Data Engineering(TKDE), 16: 1370-1386 (2004).

DOI: 10.1109/tkde.2004.68

Google Scholar

[4] Alter, O., Brown for Comparative Analysis of Genome-Scale Expression Data Sets of Two Different Organisms. Proc. Natl. Acad. Sci. USA, Vol. 100(6): 3351-3356, March ( 2003 ).

DOI: 10.1073/pnas.0530258100

Google Scholar

[5] Bar-Joseph, Z., Gerber, G., Gifford, D.K., Jaakkola, T.S. and Simon, I. A new apporach to analyzing gene expression time series data. In Proc. 6th Annual International Conference on Computational Molecular Biology, 39-48 ( 2003).

DOI: 10.1145/565196.565202

Google Scholar