Search Results for "english grammar"

The Ring is a practical general-purpose multi-paradigm language. The supported programming paradigms are Imperative, Procedural, Object-Oriented, Functional, Meta programming, Declarative programming using nested structures, and Natural programming. The language is portable (Windows, Linux, macOS, Android, etc.) and can be used to create Console, GUI, Web, Games and Mobile applications. The language is designed to be Simple, Small and Flexible.

Bol Processor is a program for music composition and improvisation with real-time MIDI, MIDI file, and Csound output. It produces music from a set of rules (a compositional grammar) or from text scores which may be typed or captured from a MIDI instrument.

UniCC (UNIversal Compiler-Compiler) compiles an augmented grammar definition into a program source code that parses the described grammar. Because UniCC is intended to be target-language independent, it can be configured via template definition files to emit parsers in almost any programming language. UniCC comes with out of the box support for the programming languages C, C++, Python (both 2.x and 3.x) and JavaScript. Parsers can also be generated into JSON and XML.

Automatic correction of software bugs announced in compilers (clang, gcc) / Static Code Analysis tools (cppcheck, FindBugs) and grammar/style errors like in LanguageTool. Usage: use tool (e.g. cppcheck) and store results in a text file. Afterwards call: autoreplacerplus mytextfile

PackCC is a packrat parser generator for C, which can handle PEGs (Parsing Expression Grammars) very efficiently, and can support direct and indirect left-recursive grammar rules.

Styx is a scanner and parser generator designed to address some shortcomings of the traditional lex/yacc combination. It has unique features like automatic derivation of depth grammar, production of the derivation tree including it's C interface which provides access to the abstract syntax tree, preservation of full source information and pretty printing to facilitate source-source translation, persistence to aid rapid interpreter writing. For application in contemporary computing...

OGDL is a structured format for representing graphs of information, alternative to XML. Its grammar is very simple allowing for compact parsers. The text version is easily readable; the binary version is used for storage and interprocess communication.

PTFS - is a file system allowing to navigate through parse tree. It uses parsing expressions grammar to construct file system structure (parse tree) for the given text.

WMI is an open web-based eLearning system in mathematics for grammar school and/or university students, including basic mathematical functions (equation solving, function plotting, symbolic differentation and antiderivation) and thematic modules.

Tsunami is an open-source high performance computing language. With it you can write streaming data-parallel algorithms that utilize GPGPUs for orders-of-magnitude speed-up with the ease of writing sequential algorithms.

A parser generator based on parsing expression grammar rules. It generates code and accepts actions in LLVM Assembly rather than C like its predecessor, PEG, did.

GRAMophone is an algorithmic generator of music composition. The music is generated using two kinds of formal grammar: Chomsky’s grammar for TOP DOWN approach to the composition and a reduced version of Lindenmayer grammar for BOTTOM UP approach.

YAXX is an XML extension to YACC, a well-known public-domain compiler-compiler. This extension allows a program of a YACC grammar to be automatically converted into an XML document.

ConjuGNU is a GNU verb conjugation program. It will soon become a fully fledged grammar checker, hopefully to be integrated in OOo. Currently only for Spanish, it will include English, French, Italian, Portuguese and others, most likely in that order.

The EBNF Library scans strings with respect to a given EBNF grammar and returns a tree structure for the matches. It is an easy-to-use tool for scanning complex input.

In a nutshell it takes as input the formal specification of any text protocol in ABNF and generates the parser in C language for that grammar using lex/yacc.

XML C Parser Generator (xmlcpg) is a xml processor coupled with a flex/bison C parser generator. A DTD can be processed to build a specialized parser for the grammar.

Grammar deployment is the process of turning a given grammar specification into a working parser. The Grammar Deployment Kit (for short, GDK) provides tool support in this process based on grammar engineering methods.

The fast, flexible parsing engine. Parse anything in 4 steps: (1) define a grammar, (2) load the grammar into ClearParse, (3) call the engine to parse the source, and (4) traverse the parsing tree. You can even change your grammar at run time.

The Language Machine is a toolkit for language and grammar: a library, main program, and self-hosted rule compilers with one frontend. The system is easy to use. It directly implements unrestricted rule-based grammars with actions and external interfaces.

Uni is a lazy semi-functional programming language with flexible, customizable syntax and grammar.