Search Results for "ll"

rtsp-simple-server is a ready-to-use and zero-dependency server and proxy that allows users to publish, read and proxy live video and audio streams. Publish live streams to the server Read live streams from the server. Proxy streams from other servers or cameras, always or on-demand. Streams are automatically converted from a protocol to another. For instance, it's possible to publish a stream with RTSP and read it with HLS. Serve multiple streams at once in separate paths Authenticate...

It is an LL(1) recursive descent parser generator written in VB.NET which can generate a scanner, parser, and parsetree file in either C# , Java or VB code. The original code and documentation can be found in the article 'A Tiny Parser Generator v1.2' on CodeProject. Requires dotNet2.0

Xi is a programming language which attempts to play a similar role to languages such as C, C++, or D. It is initially designed to leverage the procedural and object-oriented paradigms. It aims to provide an expressive language based off of a simple, LL(1) grammar with a comprehensive class library.

Tool to transcribe Parsing Expression Grammar into a parser written in Java. Parsing Expression Grammar (PEG) is a way to specify recursive-descent parsers with limited backtracking. The use of backtracking lifts the LL(1) restriction usually imposed by top-down parsers. In addition, PEG can define parsers with integrated lexing. Unlike some existing parser generators for PEG, the tool does not produce a complex and storage-hungry "packrat parser", but a collection of transparent...

Fluent is a localization system designed to unleash the expressive power of the natural language. This repository contains the specification, the reference implementation of the parser and the documentation for Fluent. FTL is the syntax for describing translation resources in Project Fluent. FTL stands for Fluent Translation List. The syntax/ directory contains the reference implementation of the syntax as a LL(infinity) parser. The spec/ directory contains the formal EBNF grammar...

...://www.youtube.com/watch?v=ll-CIfFIoOQ In the video there was a case with a mistake SharpDevelop which made breakdown of thedesigner of the MainForm. I cured it.

PEG.js is a simple parser generator for JavaScript that produces fast parsers with excellent error reporting. You can use it to process complex data or computer languages and build transformers, interpreters, compilers and other tools easily. PEG.js is still very much work in progress. There are no compatibility guarantees until version 1.0. Based on parsing expression grammar formalism, more powerful than traditional LL(k) and LR(k) parsers. Usable from your browser, from the command line...

Coco/S is a compiler generator that takes plain EBNF grammar files and features a SAX style call back API. It is written in Java and produces a Java Scanner (Lexer) and Parser for the language described by the input grammar. Coco/S is a branch of the 2010/11 release of Coco/R for Java. While Coco/R takes an attributed grammar file, Coco/S has a callback API. This has the advantage of a clean separation between grammar (EBNF) and Compiler/Interpreter.

Common Text Transformation Library of C++ classes and functions to parse and modify STL strings. CTTL substring classes may be compared, inserted, replaced, and parsed with EBNF grammars. Compiled program implements recursive descent LL(INF) parser.

fntrace is a powerfull shell used for hack and automate many hardless tasks. It permite to manipulate easily binary files like elf and some else. It based on modules for extending functionalities; you can write it on perl python or C.

A simple way to create a syntax highlighting editor for a custom language/grammar and/or create custom grammar parsers. This is a .NET project written in C#. See details here: http://acct001.com/wordpress/?p=190

lightJacc is a small but strong grammar parser generator. It adopts a parsing strategy of its own: dynamic concurrent parsing -- which made it much stronger than LR or LL family CCs (YACC, ANTLR, etc), but still keep good performance.

HiLexed 2 is a dynamic hierarchical LL-parser system with integrated lexing. It features a powerful unlimited look-ahead, look-ahead compression*, dynamic rules and left-recursion*. * = Under development

Easyfreedb is a cross-platform C++ library for accessing data on a freedb server. It supports protocol level 6 (UTF-8) and uses Boost's LL parser framework for parsing. Easyfreedb has a C-wrapper to make it easy to use from other programming languages.

A parsing toolkit that supports both top-down (LL(1) and Simple Precedence) and bottom-up parsing (LR(0), SLR(1), LR(1) and LALR(1)). The toolkit supports generating Java parsers for all the bottom-up parsing methods, based on a CUP definition.

CppCC is an object-oriented scanner and LL(k) parser generator. It aims to replace LEX&YACC for those who write C++ applications that involve parsing.

Simple interpreter of Pascal’s language, which will include: operations in/out, simple arythmetics operations: +,-,*,/, declaration of variables, dynamic memory allocation. We’ll write this using Borland C++ Builder.

cutee, a C++ Unit Testing Easy Environment. It automatically creates and updates Makefiles, \\\\\\\"runner\\\\\\\" classes and main test application. You\\\\\\\'ll only need to write your very own test functions.

A simple, nice and instructive nonrecursive predictive syntactical analyser for LL(1) grammars, just to play with it for fun.

Simple University project of a compiler based in the Croatian language. Implemented in C++, using a LL(1) grammatical , with a syntax like Perl, excluding arrays or other complex primitive variable. I didn't finished the semantic analyzer.. :(