parser » Page 8 » Developer.Team

Elerium HTML .NET Parser 1.7

Elerium HTML .NET Parser 1.7
Elerium HTML .NET Parser 1.7 | 579 kB


Elerium HTML .NET Parser is a .NET component for parsing and manipulating HTML/XML documents and Cascading Style Sheets (CSS). The HTML Parser can be used in WinForms and ASP.NET (C#, VB.NET) applications. Component is fully independent and requires only .NET Framework. Elerium HTML .NET Parser is available in two versions: Lite and Pro. The Lite version includes HTML Parser without CSS parser and does not allow to manipulate CSS files.
Read more

Bestcode JbcParser 4.2

Bestcode JbcParser 4.2
Bestcode JbcParser 4.2 | 121 kB


JbcParser is a Java library to parse and evaluate mathematical expressions given as strings at runtime. JbcParser source code can be compiled with JDK 5, 6, 7 and 8. The binaries are compiled with JDK 1.5 for backward compatibility. You get the source code and the compiled jar when you buy this parser library.
Read more

Bestcode bcParserPHP 1.6

Bestcode bcParserPHP 1.6
Bestcode bcParserPHP 1.6 | 31 kB


mathparser.php implements a MathParser class that parses and evaluates math formulas given as strings at runtime. PHP already has an eval() function for similar purposes. However eval() has security problems where a user supplied expression can cause havoc when executed on a web server or elsewhere. bcParserPHP works around this problem by parsing and evaluating the mathematical expression without using eval() function. bcParserPHP is tested with PHP version 5.2.9 and 5.6.8. The library utilizes newer PHP constructs such as classes, constructors, exceptions.
Read more

Bestcode bcAuthenticate 2.2

Bestcode bcAuthenticate 2.2
Bestcode bcAuthenticate 2.2 | 5 Mb


Bestcode Math Parser Components parse and evaluate mathematical expressions given as strings at runtime (aka formula parser). The expression can contain predefined or user defined variables and functions. When evaluation is requested, the parser compiles the expression into a parse tree. Further evaluations are made using this tree that represents the expression. The parser can optimize the tree by simplifying branches that evaluate to a constant. Upgrades are free for registered users. The math parser components are available in various versions for different platforms/languages.
Read more