|
|
|
|
+ Search |
 
|
Nov 21st, 2006 14:19
Knud van Eeden,
---------------------------------------------------------------------- --- Knud van Eeden --- 28 October 2003 - 12:24 pm -------------------- Algorithm: Expression: Infix: Convert: Postfix: Overview: How convert infix to postfix expression? --- 1. Method: Use a stack and a priority table 1. Your infix expression does NOT contain brackets 2. Your infix expression does contain brackets --- 2. Method: Use a grammar 1. Parse your expression using a top down recursive descent parser 2. Parse your expression using a bottom up parser --- --- Internet: see also: --- Algorithm:Expression:Infix:Convert:Postfix:How convert infix to postfix expression? No bracket [RPN] http://www.faqts.com/knowledge_base/view.phtml/aid/26065/fid/585 --- Algorithm:Expression:Infix: Convert: Postfix: How convert infix to postfix expression? Bracket [RPN] http://www.faqts.com/knowledge_base/view.phtml/aid/26070/fid/585 --- Language: Computer: BBCBASIC: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28007/fid/768 --- Language: Computer: C#: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28196/fid/791 --- C++: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28152/fid/163 --- Microsoft: .NET: Visual Studio: Visual Basic .net: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28003/fid/1610 --- Delphi: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28026/fid/175 --- Language: Computer: Java: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28221/fid/165 --- Java: Borland JBuilder: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28235/fid/165 --- Language: Computer: JavaScript: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28238/fid/53 --- TSE: Simple: How to convert infix to suffix? [Bracket] http://www.faqts.com/knowledge_base/view.phtml/aid/28023/fid/1236 --- Algorithm: Expression: Infix: How do you evaluate an infix expression? http://www.faqts.com/knowledge_base/view.phtml/aid/5269/fid/585 --- Data structure: Stack: Expression: Postfix: Evaluate: How do you evaluate an RPN expression? http://www.faqts.com/knowledge_base/view.phtml/aid/26059/fid/1279 --- BBCBASIC: Data structure: Simple: Suffix: How do you evaluate an RPN expression? [postfix] http://www.faqts.com/knowledge_base/view.phtml/aid/43184/fid/768 --- Algorithm: Expression: Postfix: Convert: How to convert a binary tree to a postfix expression? [RPN] http://www.faqts.com/knowledge_base/view.phtml/aid/26085/fid/585 --- Algorithm: Expression: Postfix: Convert: How to convert a postfix expression to a binary tree? [RPN] http://www.faqts.com/knowledge_base/view.phtml/aid/26081/fid/585 --- Data structure: Tree: Binary: Traversal: Walk: Order: How to walk in order a binary tree? http://www.faqts.com/knowledge_base/view.phtml/aid/25844/fid/1266 --- Data structure: Tree: Binary: Print: Recursion: How to print a binary tree? http://www.faqts.com/knowledge_base/view.phtml/aid/25815/fid/1266 ----------------------------------------------------------------------