[x]
Posted via EE Mobile

Search, ask, and monitor your questions on the go with EE Mobile. Visit Experts Exchange from your mobile device and never be out of touch again.

Question
[x]
Attachment Details
[x]
The Solution Rating System

With so many solutions, how can you tell which solutions are most likely to help you and which ones are not? To provide you with a tool to use, we rate our solutions based on various elements that most accurately determine if a solution is a quality solution. To explain what factors affect the solution rating, here are the elements we take into consideration when formulating our solution rating.

  • The Grade of the Solution
  • The Zone Rank of the Expert Providing the Solution
  • The Number of Author and Expert Comments
  • The Number of Experts Contributing
  • The Feedback of the Community

Your Input Matters
Because of the way the system is set up, the most important variable in this equation is you. As a member of Experts Exchange, you are able to cast your vote on the quality of the solutions in regard to how complete, accurate, helpful and easy to understand each solution is. When you provide your feedback, each rating is adjusted accordingly. So, if you see a solution that has a poor rating that you think is a good solution, let us know by rating it. As you do, the rating will be adjusted and will become more accurate for other members of our site.

If you have any suggestions that you would like to make for our rating system, please ask a question in the Suggestions Zone of Community Support.

Thank you!

7.1

Converting a prefix expression to an expression/syntax tree

Asked by hagur in Parsers, C# Programming Language

Tags: C#

Hi,

I'm experimenting with prefix notation, I need to convert it to an abstract syntax tree or expression tree as it's also called.

I've created a data structure for the tree, which are two classes and I've attached them both as code snippets.

An example of a prefix expression I need to read into my tree structure is: + * A B / C D

I don't seem to be able to figure out how to do this properly ... a solution or a pointer in the right direction would be much appreciated :-)
1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:
20:
21:
22:
23:
24:
25:
26:
27:
28:
29:
30:
31:
32:
33:
34:
35:
36:
37:
38:
39:
40:
41:
42:
43:
44:
45:
46:
47:
48:
49:
50:
51:
52:
ASTree class:
 
using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using InfixPostfixPrefix.Converters;
 
namespace InfixPostfixPrefix
{
    public enum TokenCodes
    {
        INTEGER = 0,
        ADD_OPERATOR = 1,
        SUBTRACT_OPERATOR = 2,
        MULTIPLY_OPERATOR = 3
    }
 
    public class ASTree
    {
        public ASTreeNode RootNode { get; set; }
 
        public ASTree()
        {
            RootNode = new ASTreeNode();
        }
    }
}
 
ASTreeNode class:
 
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
 
namespace InfixPostfixPrefix
{
    public class ASTreeNode
    {
        public string Root { get; set; }
        public TokenCodes TokenCode { get; set; }
        public ASTreeNode RightNode { get; set; }
        public ASTreeNode LeftNode { get; set; }
 
        public bool IsLeaf
        {
            get { return (RightNode == null && LeftNode == null); }
        }
    }
}
 
Related Solutions
Keywords: Converting a prefix expression to an e…
 
Loading Advertisement...
 
[+][-]09/16/08 02:52 AM, ID: 22486536Accepted Solution

View this solution now by starting your 30-day free trial. Setting up your free trial is quick, easy, and secure. We will return you to this solution, unlocked, when you're done.

About this solution

Zones: Parsers, C# Programming Language
Tags: C#
Sign Up Now!
Solution Provided By: rambovn
Participating Experts: 1
Solution Grade: B
 
 
Loading Advertisement...
20091021-EE-VQP-81 / EE_QW_2_20070628