antlr
The Purdue Compiler Construction Tool Set (PCCTS).
Install
- All systems
-
curl cmd.cat/antlr.sh
- Debian
-
apt-get install pccts - Ubuntu
-
apt-get install pccts - Kali Linux
-
apt-get install pccts - CentOS
-
yum install antlr - Fedora
-
dnf install antlr-tool - Windows (WSL2)
-
sudo apt-get updatesudo apt-get install pccts - OS X
-
brew install antlr-tool - Raspbian
-
apt-get install pccts - Dockerfile
- dockerfile.run/antlr
pccts
The Purdue Compiler Construction Tool Set (PCCTS).
PCCTS consists of ANother Tool for Language Recognition (ANTLR), a DFA-based Lexical analyzer Generator (DLG) and assorted other utilities designed for the construction of compilers and other language translators. ANTLR is a parser generator which generates recursive descent parsers which are easier to debug than the table driven bottom-up parsers created by YACC. It also provides support for the automatic generation of Abstract Syntax Trees (AST's). Many projects have stopped using PCCTS and moved on to antlr, which is also packaged for Debian. New projects should probably look there first. However PCCTS will be maintained in Debian as long as there is interest in doing so.
antlr-tool
ANother Tool for Language Recognition
antlr
language tool for constructing recognizers, compilers etc
ANTLR, ANother Tool for Language Recognition, (formerly PCCTS) is a language tool that provides a framework for constructing recognizers, compilers, and translators from grammatical descriptions containing C++ or Java actions [You can use PCCTS 1.xx to generate C-based parsers]. Computer language translation has become a common task. While compilers and tools for traditional computer languages (such as C or Java) are still being built, their number is dwarfed by the thousands of mini-languages for which recognizers and translators are being developed. Programmers construct translators for database formats, graphical data files (e.g., PostScript, AutoCAD), text processing files (e.g., HTML, SGML). ANTLR is designed to handle all of your translation tasks.