Writing an interpreter in Go

Repository contains code for my implmentation of a basic tree-walk-interpreter written in Go, referenced from the text W.A.I.I.G. by Thorsten Ball

It’s difficult to make generic statements about interpreters since the variety is so high and none are alike. What can be said is that the one fundamental attribute they all share is that they take source code and evaluate it without producing some visible, intermediate result that can later be executed. That’s in contrast to compilers, which take source code and produce output in another language that the underlying system can understand.

Implementation (tree-walk, bottom-up)

the lexer (Lexing done by a lexer, tokenizer, scanner. Basically identiyfing what the raw input contains and change the representation of source code from TEXT -> TOKENS)
the parser output of parser the AST is pretty abstract - no paren, semic, braces. Takes in "tokens" of the source code and returns a data structure (and whether it conforms to the standards of that data structure) hence called syntactic analysis
the Abstract Syntax Tree (AST)
the internal object system
the evaluator

Lexer

REPL (Read Eval Print Loop)

Parser (RD/Pratt)

Top-Down parsing (from AST root node), Bottom-up parsing and variations REcusrive descent, early parsing, predictive parsing derieved from top down

"Expressions produce values, statements dont" situational but relevant here
- x=5 no
- return 5 no
- 5 yes 5

nav33nb/interpreter-go

ErrorLooks like something went wrong!

About

Resources

Uh oh!

Stars

Watchers

Forks

Releases

Packages 0

Languages

Error
Looks like something went wrong!

Packages