At the time of writing, I'm studying an university module about Set Theory. I found this subject very interesting. Especially how it is related to SQL, and how set based operations work. Therefore, I wanted to write a simple interpreter for set operations, to improve my understanding of Set Theory, data structures, Lexers, Parsers and Interpreters.
- The Lexer translates text into tokens.
- The Parser creates a tree from the tokens.
- The Interpreter evaluates the tree.
Example operations for the set theory interpreter:
| Expression | Result |
|---|---|
{1,2,3} \union {3,4,5} |
{1,2,3,4,5} |
{1,2,3} \intersect {3,4,5} |
{3} |
{1,2,3} \diff {3,4,5} |
{1,2} |
{1,2,3} \symdiff {3,4,5} |
{1,2,4,5} |
{1,2,3} \symdiff {3,4,5} \union {10} |
{1,2,4,5,10} |
{{1},1} \union {{1},{},1,2} |
{{1},1,{},2} |