A reasonable implementation for a path DSL
-
Updated
Mar 9, 2017 - Go
A grammar describes the syntax of a programming language, and might be defined in Backus-Naur form (BNF). A lexer performs lexical analysis, turning text into tokens. A parser takes tokens and builds a data structure like an abstract syntax tree (AST). The parser is concerned with context: does the sequence of tokens fit the grammar? A compiler is a combined lexer and parser, built for a specific grammar.
A reasonable implementation for a path DSL
State machine parser and lexer for custom formulae
Expressive, noiseless, interpreted, toy programming language
The monkey programming language - https://interpreterbook.com/
http and websocket scripting language
A general-purpose lexical analyzer written in Go.
This repository is my exercises of Compiler course.
Natural Language Tokenizer
Lipi is an interpreted programming language written in go