Top down operator precedence in Go
Switch branches/tags
Nothing to show
Clone or download
Fetching latest commit…
Cannot retrieve the latest commit at this time.
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
LICENSE
README.md
example.tdop
lexer.go
main.go
parser.go
token.go
tokenRegistry.go

README.md

Top down operator precedence

This repository contains an implementation of a top down operator precedence parser written in Go. It accompanies my article at cristiandima.com/top-down-operator-precedence-parsing-in-go/ where I write more on the method and use the code in this repo to show the algorithm in practice.

The program takes a source file name as an argument and prints out a lisp-like representation of the abstract syntax tree generated for that code. A source code sample file for the language this parser can parse is included in this repo (example.tdop).

Examples

basic types

x = 5;
isHuman = true;
name = "John Doe";

if blocks

if true and not false {
  do_stuff();
}

if a == true and b == not true {
  do_this();
} else if not a and b {
  do_that();
} else {
  do_this_and_that();
}

while loops

i = 0;
list = [1, 2, 3];
while i < len(list) {
    do_stuff(list[i]);
    i += 1;
}

functions

sum = (a, b) -> a + b;
add_one = x -> x + 1;
print_hello = () -> {
    print("Hello World!!");
}
(s -> {
    text = "Hello " + s + "!!!";
    print(text);
})("John Doe");

tuples

mult_and_sum = (a, b) -> {
    m = a * b;
    return (m, a+b);
}