lalr
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 64 public repositories matching this topic...
A simple proof of concept for the lalr parsing method.
-
Updated
Apr 26, 2024 - C
🦀 Rusty LALR(1) parser generator
-
Updated
Jul 22, 2023 - Rust
A toy statically typed interpreted language
-
Updated
Sep 18, 2024 - Rust
inofficial repo with sources for java_cup from http://www2.cs.tum.edu/projects/cup/releases/
-
Updated
Dec 28, 2021 - Java
Bottom Up Parsers - Compiler Design
-
Updated
Dec 11, 2021 - Python
LALR, SLR generator macro library in Nim.
-
Updated
Jan 27, 2023 - Nim
Academic project for The Compiler Desing course. Spring 2019
-
Updated
Jul 28, 2020 - Python
A playground for some flex/bison experiments in cpp
-
Updated
Nov 18, 2019 - Yacc
An implementation of LALR(1) parser generator in Java with synthesized attributes and parsing automaton visualization
-
Updated
Dec 1, 2023 - Java
Modern LALR(1) parser generator and parser for C++
-
Updated
Feb 21, 2024 - C++
Compiler Design experiments including c, flex, bison, scanner, java and other codes
-
Updated
Apr 23, 2024 - C++
Este es un intérprete en el que se pueden realizar operaciones matemáticas básicas: suma, resta, multiplicación y división.
-
Updated
Mar 4, 2023 - Python
- Followers
- 10.4k followers
- Wikipedia
- Wikipedia