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

Abstract:

Article Preview

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.

Info:

Periodical:

Edited by:

Qi Luo

Pages:

1350-1353

DOI:

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

Citation:

T. Wang et al., "An Effective Conversion Algorithm of Arithmetic Expression from Infix Form to Prefix Form", Applied Mechanics and Materials, Vols. 58-60, pp. 1350-1353, 2011

Online since:

June 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.