language-lua2 alternatives and similar packages
Based on the "Language" category.
Alternatively, view language-lua2 alternatives based on common mentions on social networks and blogs.
-
elm-compiler
Compiler for Elm, a functional language for reliable webapps. -
purescript
A strongly-typed language that compiles to JavaScript -
stylish-haskell
Haskell code prettifier [Moved to: https://github.com/haskell/stylish-haskell] -
haskell-src-exts
Manipulating Haskell source: abstract syntax, lexer, parser, and pretty-printer -
haskell-tools-ast-fromghc
Developer tools for Haskell -
liquid-fixpoint
Horn Clause Constraint Solving for Liquid Types -
nirum
Nirum: IDL compiler and RPC/distributed object framework for microservices -
language-python
A parser for Python 2.x and 3.x written in Haskell -
elm-export
Create Elm types and JSON decoders from Haskell source. -
tal
An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew) -
shentong
A Haskell implementation of the Shen programming language. -
camfort
Light-weight verification and transformation tools for Fortran -
language-c-quote
C/CUDA/OpenCL/Objective-C quasiquoting library. -
aterm-utils
Utility functions for working with aterms as generated by Minitermite -
language-ecmascript
Haskell library: ECMAScript parser, pretty-printer and additional tools -
language-rust
Parser and pretty-printer for the Rust language -
ministg
Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.
Static code analysis for 29 languages.
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of language-lua2 or a related project?
README
Unmaintained!
This parser works but is extremely slow and memory-intensive. You should probably use language-lua instead.
The main impetus behind this project was style-checking lua code, which requires token information to stick around after parsing.
Currently, this parser tags each AST node with the list of tokens used to produce it. Instead, the parser should simply tag each AST node with the indicies of the first and last token used to produce it, along with a vector of tokens.