# Lec07 - ECE 212 Digital Circuits II Monday 18 February 2007...

This preview shows pages 1–4. Sign up to view the full content.

1 ECE 212 Digital Circuits II Monday, 18 February 2007 ± HW Set 7: Problem 1 No Presenter Problem 2 Nick W. Problem 3 Derek A. Problem 4 Humberto A. Problem 5 Rhodes B. Problem 6 Today's Goals ± To undestand postfix and prefix notation for arithmetic expressions. ± To understand an entity known as a stack. ± To understand how to use a stack to evaluate postfix expressions. ± To introduce the Stack Calculator that you will design in the laboratory (our final FPGA project).

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Notation Systems a b a + b a b a b + a b a b ~ a b a b a + b a a ~ Infix Notation Prefix Notation Postfix Notation Lukasiewicz Notation Polish Notation Reverse Polish Notation (RPN) Binary Operations (two operands): Unary Operation (one operand): a ' 20th centruy Polish logician. Notation Example (A B ') + ( ( C ' D ) ( E + F )) Infix Notation Prefix Notation Postfix Notation Need parentheses. No parentheses. No parentheses. + A ~ B ⊕• ~ C D + E F F E + D C ~ •⊕ B ~ A +
Stack A Stack is a memory with limited access. Memory

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 9

Lec07 - ECE 212 Digital Circuits II Monday 18 February 2007...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online