Search Results for "grammar"

MuLanPa is a source-analyser with a configurable parser and may be may be used for several programming-languages. Its xml-output should be used for tools like project-browsers or code-viewers like moritz (www.sourceforge.net/projects/moritz/) .

semantic is a Haskell library and command line tool for parsing, analyzing, and comparing source code. Run semantic --help for complete list of up-to-date options. Semantic uses tree-sitter to generate parse trees, but layers in a more generalized notion of syntax terms across all supported programming languages. We'll see why this is important when we get to diffs and program analysis, but for now let's just inspect some output. It helps to have a simple program to parse. Symbols are named...

Use polacode.target, polacode.shadow, polacode.transparentBackground and polacode.backgroundColor to control image appearance. You have spent countless hours finding the perfect JavaScript grammar, matching it with a sleek-looking VS Code theme, trying out all the best programming fonts. You take three days porting over your theme before starting to use VS Code. You shell out $200 for italic cursive html attributes. The code has to look right.

...Koopa is a parser generator, made for COBOL. It can handle source files in isolation (no preprocessing required) and doesn't mind the presence of CICS/SQL fragments. The grammar is easily extensible in a way which minimizes the impact on the overall code.

CodeConics is simple, intuitive, easy to use and debug code-manipulation solution, that is grammar independent and recursion based, as opposed to other DFA(Deterministic Finite-state Automata) based solutions.

...Invoking this parser yields an explicit parse tree (AST) and a tree walker suitable for further analysis. This tool package is based upon: - ANTLR 3.2 or higher (www.antlr.org). - JDK 1.6 or higher (java.sun.com). - Grammar specifications of PHP 5.3.

PegTest is an interactive application for developing parsing expression grammars (PEGs). First, write your grammar. Then, write a test input. Finally, browse how the PEG has parsed your input.