|
| |
| | Parsing - Wikipedia, the free encyclopedia |
 | | The most common use of parsers is to parse computer programming languages. | | | A parser is a computer program that carries out this task. | | | In computer science, parsing is the process of analyzing a continuous stream of input (read from a file or a keyboard, for example) in order to determine its grammatical structure with respect to a given formal grammar. |
|
http://en.wikipedia.org/wiki/Parser
|
|
| |
| | Apache Lucene - Query Parser Syntax - Apache Lucene |
| | If you are programmatically generating a query string and then parsing it with the query parser then you should seriously consider building your queries directly with the query API. | | | In other words, the query parser is designed for human-entered text, not for program-generated text. | | | An analyzer, which the query parser uses, is designed to convert human-entered text to terms. |
|
http://lucene.apache.org/java/docs/queryparsersyntax.html
|
|
| |
| | compilers.net > directory > parser generators |
| | Parser objects are composed through operator overloading and the result is a backtracking LL(inf) parser that is capable of parsing rather ambiguous grammars. | | | Happy is a parser generator system for Haskell, similar to the tool `yacc' for C. Like `yacc', it takes a file containing an annotated BNF specification of a grammar and produces a Haskell module containing a parser for the grammar. | | | Consequently, it is the computing of these tables that is both time-consuming and complex.The GOLD Parser Builder performs this task; reading from a source grammar outline and then computing the appropriate tables. |
|
http://www.compilers.net/Dir/ParserGens.htm
|
|
| |
| | Natural Language Processing: Parser Information Page |
| | The feature-augmented parser is a top-down parser modified from Allen's algorithm in his book Natural Language Understanding (pg. | | | The code generation of a PROLOG parser is not an easy task, as the grammar rules are built into the PROLOG code. | | | Two of the parsers are modular, they generate PROLOG code from a given grammar and PROLOG facts from a lexicon. |
|
http://www.georgetown.edu/compling/parsinfo.htm
|
|
| |
| | Glossary of Parsing Terms |
| | A parser is a program, or more likely a procedure within a program, which scans a sequence of input characters or input tokens and accumulates them in an input buffer or stack as determined by a set of productions which constitute a grammar. | | | A parser generator, such as AnaGram, is a program that converts a grammar, a rule-based description of the input to a program, into a conventional, procedural module called a parser. | | | A lexical scanner is a program or procedure used as a preprocessor for a parser. |
|
http://www.parsifalsoft.com/gloss.html
|
|
| |
| | GOLD Parsing System - A Free, Multi-Programming Language, Parser |
| | Since the parse tables are programming language independent, the parser engine can be, and has been, easily implemented in different programming languages. | | | GOLD uses the LALR algorithm to analyze syntax and a Deterministic Finite Automaton to identify different classes of tokens. | | | As the information is analyzed by the scanner/tokenizer, a sequence of tokens, which represent the atoms of the source string, are created and passed to the parser. |
|
http://www.devincook.com/goldparser
|
|
| |
| | 18.1 parser -- Access Python parse trees |
| | The parser itself is created from a grammar specification defined in the file Grammar/Grammar in the standard Python distribution. | | | Be aware that the values of the sequences which are considered ``correct'' will vary from one version of Python to another as the formal grammar for the language is revised. | | | The parse trees stored in the AST objects created by this module are the actual output from the internal parser when created by the |
|
http://www.python.org/doc/current/lib/module-parser.html
|
|
| |
| | Parser Mind-Module for Artificial Intelligence -- *Stop the War |
| | The Robot AI Mind uses not a static but a dynamic parser, that is, | | | Suddenly the IQ of the AI is set to burgeon as the functionality of the Parser module burgeons. | | | Parsing in the AI will be like parsing in human infancy. |
|
http://mind.sourceforge.net/parser.html
|
|
| |
| | Parser (Java 2 Platform SE v1.4.2) |
| | SAX1 parsers are reusable but not re-entrant: the application may reuse a parser object (possibly with a different input source) once the first parse has completed successfully, but it may not invoke the parse() methods recursively within a parse. | | | Once a parse is complete, an application may reuse the same Parser object, possibly with a different input source. | | | The application can use this method to instruct the SAX parser to begin parsing an XML document from any valid input source (a character stream, a byte stream, or a URI). |
|
http://java.sun.com/j2se/1.4/docs/api/org/xml/sax/Parser.html
|
|
| |
| | Parsers Available on the Internet. |
| | A parser is a computer program that has as input a linearly ordered string of elements (letters, morphemes, words) and as output a structure (perhaps a hierarchical structure like a phrase marker, or some type of relational diagram). | | | Other analyses offer no encoding into a computer language and describe what operations a parser must execute independent of any computer language. | | | Some analyses offer parsers encoded into a computer language (LISP, PROLOG, and so on). |
|
http://www.nyu.edu/pages/linguistics/parsers.html
|
|
| |
| | JavaCC HTML Parser |
| | The parser transforms an input stream into a parse tree; the elements of the parse tree are defined in HtmlDocument. | | | The goal was to produce a parse tree which threw away very little information contained in the source file, so that by dumping the parse tree, an almost identical copy of the input document would result. | | | HtmlParse simply invokes the parser and dumps the resulting parse tree with HtmlDumper. |
|
http://www.quiotix.com/downloads/html-parser
|
|
| |
| | Parser |
| | Return the token type of the ith token of lookahead where i=1 is the current token being examined by the parser (i.e., it has not been matched yet). | | | Specify an object with support code (shared by Parser and TreeParser. |
|
http://www.antlr.org/javadoc/antlr/Parser.html
|
|
| |
| | HTML::Parser - SGML parser class |
| | The return value is a reference to the parser object. | | | There is really nothing in the basic parser that is HTML specific, so it is likely that the parser can parse other kinds of SGML documents. | | | The reason is probably that perl ends up with a lot of character copying when tokens are removed from the beginning of the strings. |
|
http://www.xav.com/perl/site/lib/HTML/Parser.html
|
|
| |
| | Link Grammar |
| | The parser is robust; it is able to skip over portions of the sentence that it cannot understand, and assign some structure to the rest of the sentence. | | | The Link Grammar Parser is a syntactic parser of English, based on link grammar, an original theory of English syntax. | | | Download all the source and data files for the link grammar parser here. |
|
http://www.link.cs.cmu.edu/link
|
|
| |
| | PXP |
| | The type of the class may be arbitrary (except three base methods which connect the object to the tree), and the parser has a mechanism to dynamically select the class of the object depending on the element type of the XML node. | | | The interface of the parser has been designed such that it is best integrated into the language O'Caml. | | | For example, it is possible to store processing instructions as tree nodes, but the parser can also be configured such that these instructions are put into hashtables. |
|
http://www.ocaml-programming.de/programming/pxp.html
|
|
| |
| | XML Parsers |
| | XT is a Java-based XSLT implementation that uses the XP parser. | | | Electric XML is an open source Java-based XML parser designed to have a small memory footprint and an intuitive operation as part of the GLUE distributed computing platform. | | | HXML is a Haskell-based non-validating XML parser that employs lazy evaluation, where an evaluation is not performed unless and until its result is needed, to keep memory requirements low (see HaXml... |
|
http://www.xml.com/pub/rg/XML_Parsers
|
|
| |
| | Log Parser 2.1 FAQ |
| | There's a bug in Log Parser through 2.1 (fixed in 2.2) that causes this problem when there are multiple filenames and the last filename is at the end of a line in the query file. | | | Log Parser is planned to support multiple inputs in the same query in version 3.0, which will ship at some unknown point in the future. | | | There's a bug in all versions of Log Parser through 2.1 that causes it to incorrectly check the local registry rather than the remote registry, so if the event log you're trying to retrieve doesn't exist on the local computer, the query will fail. |
|
http://www.larkware.com/Articles/LogParser2.0Help.html
|
|
| |
| | PARSER faq General |
| | Parser implements throughout automatic user input handling-that is, when, for example, in SQL statement you would get ' fixed to '', while PHP has only rudimentary support. | | | Parser which is compiled in safe mode (by default) protects other users who are hosted on that same server as you do from your errors. | | | Parser extensively uses object technology even in system types—string is an object with methods, while in PHP there is just set of functions to work with strings. |
|
http://www.parser.ru/en/faq/general
|
|
| |
| | The LEMON Parser Generator |
| | The file lemon.c is the parser generator program itself. | | | Lemon using a different grammar syntax which is less prone to programming errors. | | | It takes a context free grammar and converts it into a subroutine that will parse a file using that grammar. |
|
http://www.hwaci.com/sw/lemon
|
|
| |
| | Templates Parser User's Guide |
| | The templates parser package has been designed to parse files and to replace some specific tags into these files by some specified values. | | | In fact, now the Ada program just compute some values, get some data from a database or whatever and then call the templates parser to output a page with the data displayed. | | | Every line starting with @@– are comments and are completly ignored by the parser. |
|
http://perso.wanadoo.fr/pascal.obry/archive/templates_parser.html
|
|
| |
| | SERL: jb -- Bison Parser and Lexer Generating Java |
| | The C file output by Bison is scanned to extract the parse tables andconstants. | | | (0) Dropped the example version of the java parser that uses the generic lexer, and added an example version of the IDL parser that uses the generic lexer. | | | Other versions probably will work as well as long as the bison output parser is not wildly changed, but jb will issue a warning when using other versions. |
|
http://www.cs.colorado.edu/serl/misc/jb.html
|
|
| |
| | flipcode - XML Parser |
| | The convert function may be null if the encoding is a single-byte encoding, that is if map[b] >= -1 for all bytes b. | | | /* Constructs a new parser; encoding is the encoding specified by the external protocol or null if there is none specified. | | | In the heart of the wrapper is the XmlNodeRef class which is a smart pointer to the XmlNode class, and takes care of the memory managment issues. |
|
http://www.flipcode.org/cgi-bin/fcarticles.cgi?show=64049
|
|
| |
| | Pod::Parser - base class for creating POD filters and translators |
| | ## Create a parser object and have it parse file whose name was ## given on the command-line (use STDIN if no files were given). | | | , pass the parse-tree as an argument to the referenced subroutine (or named method of the parser object) and return the result instead of the parse-tree object. | | | Specifying -expand_text tells parse_text() to ``preprocess'' every such text-string it sees by invoking the referenced function (or named method of the parser object) and using the return value as the preprocessed (or ``expanded'') result. |
|
http://www.xav.com/perl/lib/Pod/Parser.html
|
|
| |
| | Simple javascript RDF Parser and query thingy. |
| | RDF datatypes and languages are supported in the parser, but the query engine provides no way of querying against it currently, should be quite simple for anyone who wants to look at the querying parts, they really are pretty simple. | | | There's an old basic version with comments, which may make things clearer if you want to understand, or bugfix, or build on the parser, but that code is out of date, so just use it if you want to understand my crappy style. | | | Return's an array of triples that match the subject/predicate/object pattern. |
|
http://jibbering.com/rdf-parser
|
|
| |
| | Math Parser for Java - JbcParser |
| | To be efficient in repeated calculations, parser creates a parse tree at first and re-uses this parse tree for each evaluation without the need to reparse. | | | Optimizer: If Optimization is on, the parse tree will be optimized by calculating constant expression sections at once so that further evaluation requests will be quicker without the need to re-evaluate those constant branches. | | | Site license allows any number of developers use the component at your development site. |
|
http://www.bestcode.com/html/jbcparser.html
|
|
| |
| | AnaGram: LALR Parser Generator |
| | The parser is a C/C++ function that parses text according to the rules in your grammar and, as it matches rules, calls your code to deal with them. | | | You make the rules, and AnaGram makes a parser for your input. | | | Now, you can put the powerful technique of syntax directed parsing to work, to speed development of projects both large and small. |
|
http://www.parsifalsoft.com
|
|
| |
| | PHP: XML Parser Functions - Manual |
| | The parser is very forgiving and does not check for errors. | | |
If the XML parser encounters characters outside the range that its source encoding is capable of representing, it will return an error. | | | This code was made for the older one - guyemup's function - but can be used with the other variation with some slight modifications. |
|
http://www.php.net/manual/en/ref.xml.php
|
|
| |
| | Self paper: "Mango - A Parser Generator for Self" |
| | We show how to generate a Mango parser and how to use it by means of an example: a simple expression language. | | | Third, Mango automatically maintains invariance of the structure of parse trees, even while grammars are transformed to enable LR parsing. | | | First, Mango grammars are structured, thus easier to read and map onto parse trees. |
|
http://www.sun.com/research/self/papers/mango.html
|
|
| |
| | ScriptCenter Tools: Log Parser 2.2 |
| | The results of your query can be custom-formatted in text based output, or they can be persisted to more specialty targets like SQL, SYSLOG, or a chart. Most software is designed to accomplish a limited number of specific tasks. | | | Microsoft Log Parser falls squarely into this category. Any time you're faced with the necessity to wade through a lot of textual data to find some bits, or to analyze patterns, it's worth thinking of this tool." (ADTMag.com) | | | And, Professor Windows can show you how Log Parser version 2.2 works. |
|
http://www.microsoft.com/technet/scriptcenter/tools/logparser/default.mspx
|
|
| |
| | XML and Scheme |
| | SSAX is a full-featured, algorithmically optimal, pure-functional parser, which can act as a stream processor. | | | The framework consists of a DOM/SXML parser, a SAX parser, and a supporting library of lexing and parsing procedures. | | | We should note that many parts of the SSAX parser toolkit have been designed with the pull model in mind. |
|
http://okmij.org/ftp/Scheme/xml.html
|
|
| |
| | alphaWorks : P3P parser : Overview |
| | No researcher information for P3P Parser is available at this time. | | | A P3P protocol parser and constructor, written in 100% pure Java, that makes personal information sharing more private. | | | Any questions regarding the creators of this technology will be answered in the discussion forum. |
|
http://www.alphaworks.ibm.com/aw.nsf/376583DBD044EE5988256ACD00318D15/22F05184662C98CD882566F300703F74?opendocument
|
|
| |
| | Home page of XML Pull Parser (XPP) |
| | On top of XPP2 parser I have built a very simple XML document model API that allows to create XML node tree incrementally (so only parts of XML document that user read from input are actually in memory). | | | This means that XPP is representing the simplest way of processing XML that you can get (working with tokenizer would be even lower level but is not simple and most of applications would be much more complex to extract useful information from XML tokens...). | | | Another one that will be using Xerces 2 XNI is under development. |
|
http://www.extreme.indiana.edu/xgws/xsoap/xpp
|
|
| |
| | DecisionSoft Open Source |
| | Pathan has been developed jointly by DecisionSoft, Sleepycat Software, Stylus Studio, and Parthenon Computing. | | | DecisionSoft has open sourced Pathan, an XPath compliant parsing and evaluation module for the Xerces-C XML parser by the Apache Software Foundation. | | | Close integration with the Xerces-C parser allows the rapid development of advanced XML applications. |
|
http://software.decisionsoft.com
|
|
| |
| | The Expat XML Parser |
| | The Simple C Expat Wrapper is a wrapper around Expat that provides a light-weight object model somewhat like a DOM. | | | C++ Wrappers for the Expat XML Parser, an article by Tim Smith providing object-oriented wrappers for Expat. | | | SAX2 Wrapper for using Expat in Delphi, based on |
|
http://expat.sourceforge.net
|
|
| |
| | The Unofficial Log Parser Support Site |
| | Log Parser is a free command-line tool from Microsoft that lets you run SQL queries against a variety of log files and other system data sources, and get the results out to an array of destinations, from SQL tables to CSV files. | | | Unfortunately, because Log Parser is essentially a skunkworks project from one of Microsoft's developers, it doesn't have much in the way of official support from Microsoft. | | | You'll need to fix up the path and file names, of course. |
|
http://www.logparser.com
|
|
| |
| | xml.apache.org |
| | A Perl wrapper is provided for the C++ version of Xerces, which allows access to a fully validating DOM XML parser from Perl. | | | A Java XML parser derived from the Sun Project X Parser. | | | A COM wrapper (also for Xerces-C) provides compatibility with the Microsoft MSXML parser. |
|
http://xml.apache.org
|
|
| |
| | Foundations of Statistical Natural Language Processing |
| | A non-probabilistic parser that people often find useful is the Link Grammar parser (C source). | | | The supply of probabilistic parsers on the web has increased a lot since the book was published. | | | An implementation of the inside-outside algorithm in C can be found on Mark Johnson's software page. |
|
http://www-nlp.stanford.edu/fsnlp/probparse
|
|
| |
| | An Introduction to XML Processing with Lark and Larval |
| | One lesson of this activity is that it may be possible for such classes to be shared independent of the parser architecture; it would be very handy if all XML-processing Java apps used the same Element class, at least as a basis for subclassing. | | | While Java comes equipped with a Hashtable object that might be considered a candidate for a symbol table, its String implementation is sufficiently inefficient that naive recourse to a String constructor and Hashtable lookup for every identifier would result in very poor performance. | | | Failing that, processors will be full-dress validating parsers with incremental parsing for authoring support. |
|
http://www.textuality.com/Lark
|
|
| |
| | Essence, an LR parser generator for Scheme |
| | Rather, the parser generator results from a general parser which takes the input grammar as a parameter; no generation and recompilation is necessary to try out changes to a grammar. | | | The generated parsers perform error recovery, and are highly efficient. | | | The generated parsers result from the general parser by an automatic program transformation called partial evaluation. |
|
http://www.informatik.uni-freiburg.de/proglang/software/essence
|
|
| |
| | Tools for compiling |
| | language: BNF (Extended) package: TCLL1 version: 1 parts: parser generator (LL(1)), parser, manual, example implementations of EULER and FP author: Thomas W. Christopher location: http://www.iit.edu/~tc/toolsfor.htm description: TCLL1 takes an extended CFG with action symbols, alternation, repetition, and conditional groupings and translates into a file of tables to be read in by the parser. | | | Retargeting the tables to other languages is in progress. | | | A Strong LL(k) Parser Generator That Accepts Non-LL Grammars and Generates LL(1) Tables: Extended Abstract |
|
http://www.iit.edu/~tc/toolsfor.htm
|
|
| |
| | Cheaper by the Dozen |
| | As ; an example of the parser construction, this file includes a ; semi-validating SXML parser. | | | In ; the latter case, the user must provide functions of specific ; signatures, which are called at predictable moments during the ; parsing: to handle character data, element data, or processing ; instructions (PI). | | | Like a SAX parser, the framework scans ; the document only once and permits incremental processing. |
|
http://okmij.org/ftp/Scheme/SSAX.scm
|
|
| |
| | JLex: A Lexical Analyzer Generator for Java(TM) |
| | A minimal example illustrating the use of a CUP parser with a JLex scanner. | | | A sample specification file that can be used to generate a simple lexical analyzer using JLex. | | | A web site that lists bug reports from JLex users, along with the current status of each bug. |
|
http://www.cs.princeton.edu/~appel/modern/java/JLex
|
|
| |
| | Magpie RSS - PHP RSS Parser |
| | In particular I failed to find any PHP RSS parsers that could sufficiently parse RSS 1.0 feeds, to be useful on the RSS based event feeds we generate at Protest.net. | | | use a parser based on regular expressions, making for an inherently fragile solution | | | rss_parse.inc - provides the RSS parser, and the RSS object |
|
http://magpierss.sourceforge.net
|
|
| |
| | The LEX & YACC Page |
| | Bison is a general-purpose parser generator that converts a grammar description for an LALR(1) context-free grammar into a C program to parse that grammar. | | | Once you are proficient with Bison, you may use it to develop a wide range of language parsers, from those used in simple desk calculators to complex programming languages. | | | Bison is upward compatible with Yacc: all properly-written Yacc grammars ought to work with Bison with no change. |
|
http://dinosaur.compilertools.net
|
|
| |
| | Parse a sentence |
| | More explanation of the output of the parser is available, including some common reasons your sentence might not parse when you think it should. | | | If you leave "Allow Null Links" selected, the parser will assign structure to as much of the sentence as it can. | | | If you unselect this, the parser will act as a grammar checker, simply rejecting sentences that it considers ungrammatical. |
|
http://www.link.cs.cmu.edu/link/submit-sentence-4.html
|
|
| |
| | XML Pull Parsing |
| | LOCATION to inform parser about location of input so error and diagnostic messages are more helpful | | | The API allows both fast high level iteration (using next() method) and low level tokenizing (using nextToken() token) and is designed for easy building on top of it SAX, XML pull parsers that uses iterators with event objects, or even DOM implementations. | | | 2003-05-17:new addons: Wrapper Addon extends XmlPull API and adds new convenience methods to pull parser and serializer and |
|
http://www.xmlpull.org
|
|
| |
| | John's PCCTS-based C++ Parser Page |
| | But "grammar" understates the goal of this effort, which is to supply a fully usable C++ parser, complete with preprocessor, symbol tables, and generation of context-specific syntax trees. | | | The unmodified C++ grammar from Parr Research is a GZip-compressed tar file. | | | Specifically, ANTLR and DLG output error messages in the format expected by the IDE, so that double-clicking on an error message takes you to the offending source line. |
|
http://www.empathy.com/pccts
|
|
| |
| | The Chilkat XML Parser |
| | The Chilkat XML parser is available in several different packages for different programming environments. | | | Easy to embed binary data in XML documents. | | | The Chilkat XML parser can reduce your development costs by shortening XML implementation times and reducing the learning curve for programmers unfamiliar with XML. |
|
http://www.xml-parser.com
|
|
|
