Cross-language context-sensitive parsing with type inference, left recursion resolutions and decision tree optimizations.
-
Updated
Feb 5, 2020 - Haskell
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.
Cross-language context-sensitive parsing with type inference, left recursion resolutions and decision tree optimizations.
Project Putting All Power!
MIRROR of https://codeberg.org/catseye/Fountain : A grammar formalism for CSLs supporting both efficient parsing and efficient generation
A parser generator, similar to BNFC, that takes a parsing expression grammar and outputs PEGTL C++ for it. (WIP)
Generators for building compilers.
JSON parser written with Happy / Alex
Lexical analysers generators and parser generators in Haskell