lexer
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.
Here are 1,551 public repositories matching this topic...
Scanner and parser made for Mini Pascal.
-
Updated
Apr 28, 2023 - C#
A lexer and longest common sequence finder (between JS source code files)
-
Updated
Jan 9, 2018 - JavaScript
State machine parser and lexer for custom formulae
-
Updated
Apr 26, 2017 - Go
-
Updated
Dec 29, 2020 - Assembly
Tool for inspecting typescript token list
-
Updated
Dec 11, 2019 - TypeScript
Monkey language interpreter written in Rust
-
Updated
Sep 23, 2019 - Rust
A calculator powered by lexical analysis
-
Updated
Jan 2, 2020 - Go
Development of an interpreted language for use in future projects, but mostly as a learning exercise.
-
Updated
Aug 27, 2020 - C++
- Followers
- 10.2k followers
- Wikipedia
- Wikipedia