Finding subtree in a tree
I have a tree:
Implementing the Visitor Pattern for an Abstract Syntax Tree
I’m in the process of creating my own programming language, which I do for learning purposes. I already wrote the lexer and a recursive descent parser for a subset of my language (I currently support mathematical expressions, such as + - * / and parenthesis). The parser hands me back an Abstract Syntax Tree, on which I call the Evaluate method to get the result of the expression. Everything works fine. Here is approximately my current situation (Code examples in C#, although this is pretty much language-agnostic):
How can you prove an acyclic graph has n-1 edges? [closed]
Closed 11 years ago.
How can you prove an acyclic graph has n-1 edges? [closed]
Closed 11 years ago.
Homogeneous vs. heterogeneous AST representation
What are the reasons to choose a homogeneous vs. a heterogeneous AST representation for implementing a complex domain-specific programming language?
Homogeneous vs. heterogeneous AST representation
What are the reasons to choose a homogeneous vs. a heterogeneous AST representation for implementing a complex domain-specific programming language?
Homogeneous vs. heterogeneous AST representation
What are the reasons to choose a homogeneous vs. a heterogeneous AST representation for implementing a complex domain-specific programming language?
Homogeneous vs. heterogeneous AST representation
What are the reasons to choose a homogeneous vs. a heterogeneous AST representation for implementing a complex domain-specific programming language?
Homogeneous vs. heterogeneous AST representation
What are the reasons to choose a homogeneous vs. a heterogeneous AST representation for implementing a complex domain-specific programming language?
Homogeneous vs. heterogeneous AST representation
What are the reasons to choose a homogeneous vs. a heterogeneous AST representation for implementing a complex domain-specific programming language?