Search Results for "lnk-parse"

Joker is a small interpreted dialect of Clojure written in Go. It is also a Clojure(Script) linter. Send HTTP requests, read and parse JSON, work with file system, start external processes etc. Checks for syntax errors, function arity mismatches, unresolvable symbols, unused namespaces, vars, bindings and much more. Joker uses .joke filename extension. Normally exits after executing the script, unless --exit-to-repl is specified before --file <filename> in which case drops into the REPL after the script is (successfully) executed. ...

Powerful command line and configuration file parsing for C++, Python, Ruby and Java (others to come). This tool provides many features, such as separate treatment for options, variables, and flags, unrecognized object detection, prefixes and much more.

XML-Parse library is a lightweight set of functions for parsing, checking, and creating xml files. It can support stream-oriented, SAX or DOM parsing styles, and includes an optional xsd schema validator and graphical schema generator.

NLT is free, open-source C# lexer and GLR parser suite -- which translates to ability to parse ambiguous grammars. Grammar can be defined directly in code or (preferably) in separate file (lex/yacc-like) for included generator. If you understand/guess the meaning of grammar in C#: // scanning lexer.AddStringRule(")", match => SymbolEnum.RPAREN); // parsing prod_builder.AddProduction(SymbolEnum.exp, SymbolEnum.LPAREN, SymbolEnum.exp, SymbolEnum.RPAREN, (_1, e, _3) => (AstNode)e); or grammar in NLT format: // scanning /[A-Za-z_][A-Za-z_0-9]*/ -> IDENTIFIER, IdentifierSymbol.Create($text); // parsing program -> list:namespace_list { new Program(currCoords(), (Namespaces)list) }; you should be able to use it :-). ...

A XML pull-parse library for Java 1.2, designed for processing XML protocol messages in the most efficient way possible. Contains a complete HTTP client library.

...About the unixname: The "shortname" of the project was a typo, but it was too late when I actually realised it. Features that still need to be implemented: Boolean expressions (IF) (If I ever find a flexible way to implement them, because you can't parse user input to a boolean command in QBASIC, without using a dynamically changed BAS file, which is going to fail if using it compilled) The source code should be compiled with either QB64, QuickBASIC or freeBASIC (with the -lang qb switch enabled

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.

Java library for parsing and evaluating math expressions. Javadoc is available at http://bracer.sourceforge.net/javadoc/ P.S. This library depends on Apache Commons Math, so don't forget to include commons-math-2.2.jar to your project.

The MathExt library was made to parse and calculate formulas of any complexity. It can easily be integrated into web applications. As developer you can set all kind of settings. You can even specify what commands should be available to the user.

ShaniXmlParser is a small and fast Xml/Html DOM/SAX non validating parser written in java. It can parse invalid xml files. It uses the org.w3c.dom interfaces and the jaxp interfaces. It works also on mono/.net thanks to ikvm.

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.