BNF wrangling and railroad diagrams
-
Updated
Sep 25, 2023 - C
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.
BNF wrangling and railroad diagrams
BNF Converter
Parse BNF grammar definitions
Lexer Generator and Parser Generator as a Library in Nim.
Gradle plugin for generating lexers (with JFlex) and BNF parsers (with Grammar-Kit) for IntelliJ language plugins
Transform a JSON grammar into a syntax-highlight parser for CodeMirror
Dogma: A modernized metalanguage with better expressiveness and binary grammar support
An on-the-fly parser for BNF grammars
A GNU Emacs major mode for editing BNF grammars
⌥ Simple Backus–Naur form (BNF) LaTeX package
Transform a JSON grammar into a syntax-highlight parser for ACE Editor
Sublime Text plugin for automatic code alignment.
Generates random text based on context-free grammars defined in BNF
C++ Lexer Toolkit Library (LexerTk) https://www.partow.net/programming/lexertk/index.html
A Syntax Highlighter for Firebase Rules.
Work with (E)BNF and bison/YACC Grammar: Parsing, FIRST/FOLLOW set, CNF, Conversions, LR and LL parsing tables
Image Retrieval in Digital Libraries - A Multicollection Experimentation of Machine Learning techniques
NatLang is an English parser with an extensible grammar