VHDL grammar for tree-sitter parser generator
-
Updated
May 23, 2024 - JavaScript
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.
VHDL grammar for tree-sitter parser generator
Backend for checking Lexical and Sintaxis of yalex and yapar files, also making automathons.
The implementation of the Rascal meta-programming language (including interpreter, type checker, parser generator, compiler and JVM based run-time system)
ANTLR (ANother Tool for Language Recognition) is a powerful parser generator for reading, processing, executing, or translating structured text or binary files.
A EBNF-based generator of table-driven top-down parsers of LL(k) grammars featuring predictable & configurable conflict resolution mechanism, ANYTOKEN support, retargetable back-end, etc.
a C# embeddable lexer and parser generator (.Net core)
The prettier pattern-matching parser with automatic error recovery
A Clojure idiomatic PEG parser.
My portfolio contains a lexer generator, a parser generator, my own λProlog interpreter, and several meta-theorems for the propositional logic with their proofs written in Coq.
Project Putting All Power!
Interpreted, dynamically typed, object-oriented programming language
The CongoCC Parser Generator, the Next Generation of JavaCC 21, which in turn was the next generation of JavaCC
BNF Converter
A parser library for Pony.
Front-end libraries and utilities for the Transmuter language processing infrastructure
An IntelliJ plugin for ANTLR v4