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,531 public repositories matching this topic...
Simple programming language in Rust
-
Updated
Dec 25, 2022 - Rust
Anatomize - A JavaScript-based framework for building parsers.
-
Updated
Apr 11, 2023 - JavaScript
A compiler front-end for Golang implemented using Python Lex and YACC that handles the switch , if else and loop constructs
-
Updated
Apr 12, 2023 - Python
Scanner and parser made for Mini Pascal.
-
Updated
Apr 28, 2023 - C#
PHP parser combinators
-
Updated
Feb 14, 2016 - PHP
clooc - Compilateur de LOOC en assembleur MicroPIUP/ASM - Projet de compilation TELECOM Nancy 2016-2017
-
Updated
Jun 13, 2017 - Java
An SGML file linter and compiler written using JFlex and CUP with Java
-
Updated
Jan 15, 2017 - TeX
B language Visualizer and Interpreter in Javascript and OCaml
-
Updated
Feb 14, 2019 - HTML
AbstractVM is a machine that uses a stack to compute simple arithmetic expressions. These arithmetic expressions are provided to the machine as basic assembly programs.
-
Updated
Aug 5, 2018 - C++
A reasonable implementation for a path DSL
-
Updated
Mar 9, 2017 - Go
Dedicated command-line compiler for Systems Biology
-
Updated
Mar 4, 2017 - OCaml
- Followers
- 10.1k followers
- Wikipedia
- Wikipedia