Parametrized recursive descent parser in JS
Parametrized recursive descent parser in JS
I wrote an abstract recursive descent parser in JS which accepts an array of terminal (in regexp form, or as a list of string literals) and a list of non-terminal definitions and returns the function that will parse the text. The parser "generator" has just 125 lines of code and it is an extremely lightweight solution to quickly produce purpose made languages in the browser without need for any tooling. Together with `` template strings to write your custom made language code in, it makes for a lot of fun in JS. :D Someone asked for the code in the recent thread about parsers. You need to search for it a bit though. CTRL+U :) https://megous.com/dl/parser/tests/index.html
Share cardActual performance
Launch Intel predictions
Analyze your own launch →Correct prediction on native model
Similar products
Header-only, extensible C++17 argument parser
Pq, a unixy generic protobuf parser
JMeter JTL Parser in Go
Strongly-Typed Parser Combinators for Dart
Yet Another Argument Parser for C++
NBT/Anvil Parser in Emojicode
Sparser – A Multilanguage Parser
PyIng – Ingredient parser
Naja-Verilog – Structural Verilog Parser
Cron::Parser