CONTRIBUTED ARTICLES MICSIM - A MICROPROGRAMMEDEXPRESSION PARSING SIMULATOR Part I - Language and Algorithm by S. Habib Polytechnic I n s t i t u t e of Brooklyn 11201 333 Jay S t r e e t , Brooklyn, New York INTRODUCTION Consider the transformation of i n f i x a r i t h m e t i c expression i n t o reverse Polish or s u f f i x expressions. We note the forms of the two expressions as: infix expression ~nfix-expression~ ::= ,~erm~ I~nfix-expressio~ l * I / I~primary> , <tern <boolean-operator,b ::= ) ~Drimary> ::= ( ~infix-expression> I ~ooiean-operator> ::= +J~I = I>-- I~--l>l< ::= ~letter/k l <iet ter~, ⢠a;blc :..: z suffix expression ~suffix-expres,sion> <suffix-expressionS/ I ~perator> ::= +1-1"1/1= 1> =1< =1>1< As an i l l u s t r a t i o n .i the i n f i x expression: A+E/F*G Translates to the s u f f i x expression: A, E, F, / , G, *, + This report describes an approach to the architecture of a microprogrammed t r a n s l a t o r ( i n
/lp/association-for-computing-machinery/micsim-a-microprogrammed-expression-parsing-simulator-part-i-language-ssdNuwCDGs