
	Where results make sense

Topic: Parser generator

Related Topics

Parser

Yacc

LR parser

Code

In the News (Sat 30 Aug 08)

Gordon Brown

Derby County

Mike Huckabee

Lute Olson

Pearl Harbor

Sonia Gandhi

Ricky Hatton

Narendra Modi

Jesus Christ

Rudy Giuliani

	compilers.net > directory > parser generators
		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.
		Parser objects are composed through operator overloading and the result is a backtracking LL(inf) parser that is capable of parsing rather ambiguous grammars.
		GRDP is a new style of parser generator that allows you to protoype new languages without regard to the underlying parsing technology.
	www.compilers.net /Dir/ParserGens.htm (1219 words)

	SLK Parser Generator - LL(k) backtracking C, C++, Java, and C# parser generator
		The SLK parser generator produces parsers that are nearly the fastest and most compact that is possible.
		The SLK parser generator supports a new white space delimited syntax that accepts grammars in the forms commonly found in published reference grammars.
		The table-driven parsers are generally less than one tenth the size of the equivalent recursive-descent parsers.
	home.earthlink.net /~slkpg (1691 words)

	Open Directory - Computers: Programming: Compilers: Lexer and Parser Generators (Site not responding. Last check: 2007-11-01)
		IParse - An interpretting parser, meaning that it accept on the input a grammar and a source file which should be parsed according to that grammar, and produces an abstract program tree from this.
		PCCTS is an LL(k) recursive descent parser generator with semantic predicates and backtracking.
		Styx - A scanner and lalr(1) parser generator.
	dmoz.org /Computers/Programming/Compilers/Lexer_and_Parser_Generators (1711 words)

	Towards a Standard Parser Generator</title>
		If a parser generator uses a generic C module, than this module might get included in the Python core one day, and thus be available for all generated parsers.
		For the parser generators studied, it was not difficult to generate the same abstract syntax, in particular since the concrete syntax of all parsers was similar (it could not be identical for all parsers for reasons shown below).
		YAPPS parsers integrate with the scanner through a Scanner object, which is passed to the parser as a constructor argument.
	www.python.org /sigs/parser-sig/towards-standard.html (3114 words)

	ProGrammar Parser Generator
		Parser generators are commonly used in the development of compilers and interpreters; however, they are useful any time that data elements need to be extracted from a structured data source.
		Tokens are used as input to the parser generated by Yacc.
		Many parser generators are based on Lex and Yacc, or are visual front-ends to Lex and Yacc.
	www.programmar.com /parsegen.htm (531 words)

	Elkhound and Elsa
		The parsers it generates use the Generalized LR (GLR) parsing algorithm.
		Accent is parser generator based on a combination of the Earley and LL parsing algorithms.
		ANTLR is an LL(k) parser generator with built-in lexical analyzer.
	www.cs.berkeley.edu /~smcpeak/elkhound (3106 words)

	AnaGram Parser Generator: New features in version 2.01
		To run the parser, declare an instance of the parser control block on the stack, initialize your fields in the parser control block as appropriate, lock any relevant mutexes, and then call the parser function with a pointer to the parser control block as the argument.
		Users who are building parsers for embedded systems or other uses where memory is limited may want to override this default value with their own specification.
		When you have enabled the reentrant parser switch, the parse function, the initializer function, and the parser value function are all defined to take a pointer to the parser control block as their sole argument.
	www.parsifalsoft.com /new201.html (1520 words)

	freshmeat.net: Tutorials - Lemon Parser Generator Tutorial
		Using a parser generator, along with a scanner like flex, can be advantageous because there is less code to write.
		The parser generator (lemon.c and lempar.c) takes the input from the syntax file "example1.y" and creates the parser file "example1.c", along with two other files "example1.h", which contains definitions for the tokens, and "example1.out", which gives a detailed listing of the shift reduce states for the grammar listed in "example1.y".
		Parser generators can help developers write reusable code for complex tasks in a fraction of the time they would need for writing the complete program from scratch.
	freshmeat.net /articles/view/1270 (3012 words)

	The Lemon Parser Generator
		Lemon is able to generate a list of all terminals and nonterminals by examining the grammar rules, and it can always distinguish a terminal from a nonterminal by checking the case of the first character of the name.
		Then the Parse() function generated will have an 4th parameter of type ``MyStruct*'' and all action routines will have access to a variable named ``pAbc'' that is the value of the 4th parameter in the most recent call to Parse().
		If the parser pops its stack until the stack is empty, and it still is unable to shift the error symbol, then the %parse_failed routine is invoked and the parser resets itself to its start state, ready to begin parsing a new file.
	www.hwaci.com /sw/lemon/lemon.html (4347 words)

	Recursive-Descent Parser Generator (Site not responding. Last check: 2007-11-01)
		Given a context-free grammar, a recursive-descent parser can be constructed in a few easy steps: (1) convert the grammar from BNF to EBNF; (2) check that the EBNF grammar is suitable; (3) transcribe the EBNF grammar into parsing procedures.
		The goal of this project is to build a parser generator that provides such assistance.
		In step 1 the parser generator should assist the user by responding to instructions such as "left-factorise production rules 21 and 22" or "eliminate left recursion in production rules 13 and 14".
	www.dcs.gla.ac.uk /~daw/teaching/projects/parser-generator.html (138 words)

	AN LL(1) PARSER GENERATOR WITH LOOKAHEAD - LALL
		A parser generator is a program that accepts as its input a specification of the grammar for a language, and generates as its output a program that can recognize valid sentences of the input grammar.
		A parser is a program that accepts as its input sentences of a language, and returns as its output a true value if its input sentences are valid sentences of the language described by the grammar, and false otherwise.
		In context free grammars, parser generators have dealt with ambiguity by assigning a priority to one of the distinct trees that represent the input sentence when the parser is generated.
	www.gen7software.com /lall/lallthes.htm (12495 words)

	The Gardens Point Parser Generator (Site not responding. Last check: 2007-11-01)
		The parser generator can be invoked on the command line and takes the name of the grammar specification file as input.
		The generated parser file can then be compiled either on the command line or as part of a Visual Studio 2005 project.
		The -report option of the parser generator causes it to output details of the LALR item states that were generated.
	g2.fit.qut.edu.au /GPPG (630 words)

	Parser Generator - Free Download (Site not responding. Last check: 2007-11-01)
		Parser Generator is a YACC and Lex programming tool for Windows.
		Parser Generator is able to generate C, C++ and Java parsers and lexical analysers.
		Metaspec C# parser library is designed to provide the kernel for applications which require processing C# source code: refactoring, formatting, and other similar tools.
	windows-development-tools-misc.hostrim.com /parser-generator.html (393 words)

	Bumble-Bee Software - Parser Generator - Features
		Generate single model, multiple model and multiple instance model C parsers and lexical analysers, depending upon your needs.
		Each C++ and Java parser and lexical analyser that is generated is a new derived class to which you can add your own member functions (methods) and variables.
		In particular, the error messages generated by the two tools are compatible with those recognised by Visual C++, which means that error mapping from the Output window to the relevant YACC or Lex source file can take place.
	www.bumblebeesoftware.com /features.htm (459 words)

	The LEMON Parser Generator (Site not responding. Last check: 2007-11-01)
		The parser generated by Lemon is both re-entrant and thread-safe.
		A separate file lempar.c is the template for the parser subroutine that lemon generates.
		Both the source code to lemon itself and the code that lemon generates are in the public domain.
	www.hwaci.com /sw/lemon (177 words)

	LambdaYacc Home Page (Site not responding. Last check: 2007-11-01)
		Some additional notes on the theory and implementation of the parser generator are also availble.
		Grammar and generated parser files for the "foldn" meta-logic embedded in lambda Prolog.
		This parser is currently used by Jeremie Wajs at the Pennsylvania State University to develope an interactive theorem prover.
	www.cs.hofstra.edu /~cscccl/parsergen (383 words)

	XMLBooster: The Fast XML parser generator
		Statically generates application-specific parsers, to be included royalty-free in your application.
		Generates convenient structural documentation to describe the structure of the XML files or messages your application supports.
		Generates a GUI to edit your specific XML files.
	www.xmlbooster.com (262 words)

	a parser generator for PHP - finally - Lot 49: Greg Beaver's blog
		I plan to test out the parser generator and split it into multiple files, then potentially propose it as a PEAR package.
		The generator itself can be somewhat slow, but I can generate the PHP parser (almost finished) for phpDocumentor in about 2 seconds on my computer.
		I've been using the code extensively for a number of parsers, including a parser for the PGN (chess) file format, a parser for PHP itself (working on that right now), a parser for docblocks in PHP, and there are others who have been using it as well for parsing lots of things.
	greg.chiaraquartet.net /archives/137-a-parser-generator-for-PHP-finally.html (1198 words)

	Beaver - a LALR Parser Generator
		It reads the specification of the language for which a parser needs to be generated and produces a Java source file with a Java class that represents a parser for the language.
		In order to run a Beaver-generated parser, the scanner and parser need to be generated and compiled, and the resultant "generated" parser needs to be run with the Beaver-supplied runtime parser engine.
		Though it is possible to use a generated parser immediately as-is, typically a compiler writer will implement the real parser by extending the functionality which the generated parser provides.
	beaver.sourceforge.net (551 words)

	Parser generator section at Free Download Manager
		It is able to generate C, C++ and Java parsers and lexical analysers.
		Metaspec C# parser library is designed to provide the kernel for applications which require processing C# source code: refactoring, formatting, and verification applications, and other similar tools.
		C# parser is available in two versions: a compilation parser and a transformation parser.
	www.freedownloadmanager.org /downloads/parser_generator_info (414 words)

	The Jacke Parser-Generator Tool
		Parsers are ubiquitous in computing, providing the interface between a convenient, user-friendly front-end syntax and an internal format of input data.
		Several parsers may be defined in a single file, corresponding to the definition of multiple start symbols.
		To use the generated code, make sure that the the signatures and implementation of LALR tables and parsing engine are in the environment.
	ps.uni-sb.de /~jan/jacke/jacke.html (892 words)

	The parser generator JavaCC
		It generates a parser class with methods that recognize phrases.
		Parsers can be generated so that there can be multiple instances and they can be operated in parallel.
		Calc* is developed in stages, it is supposed to demonstrate the important aspects of the parser generator, and it is patterned after examples by Chuck McManis and Sun which are delivered with javacc.
	www.cs.rit.edu /~ats/java/html/skript/8_JavaCC.htmld/index.html (1199 words)

	The Jacke Parser-Generator Tool (Site not responding. Last check: 2007-11-01)
		Parsers are ubiquitous in computing, providing the interface between a convenient, user-friendly front-end syntax and an internal format of input data.
		Several parsers may be defined in a single file, corresponding to the definition of multiple start symbols.
		To use the generated code, make sure that the the signatures and implementation of LALR tables and parsing engine are in the environment.
	www.cogs.susx.ac.uk /users/js35/jacke/jacke.html (892 words)

	XSD to SAX Parser Generator - simply complex
		The input to the code generator is an XML Schema (XSD) file that describes the XML format, and the output is a bunch of Java classes that do typed XML parsing based on the schema.
		Also, if my project needs to generate parsers for other schemas in the future (which is likely on this project), it'll be simple - the code generator is generalized and doesn't make many assumptions about the input XSD.
		The generator itself uses SAX to parse the XSD and build an in-memory representation of the types in the schema (xs:complexType and xs:simpleType) and the relationships between the types.
	www.benpryor.com /blog/index.php?/archives/13-XSD-to-SAX-Parser-Generator.html (917 words)

	Bumble-Bee Software - Parser Generator - YACC and Lex for Windows
		This is the main website for Parser Generator, a YACC and Lex programming tool for Windows.
		Parser Generator is a YACC and Lex programming tool for Windows.
		Parser Generator is able to generate C, C++ and Java parsers and lexical analysers.
	www.bumblebeesoftware.com (109 words)

	Toy Parser Generator -- A parser generator in Python (Site not responding. Last check: 2007-11-01)
		This generator was born from a simple statement: YACC is too complex to use in simple cases (calculators, configuration files, small programming languages,...).
		A grammar rule can be seen as a method of the parser class, symbols as method calls, attributes as method parameters and semantic values as return values.
		TPG has been included in FreeBSD and OpenBSD and is referenced by the SIG on Parser Generation for Python too.
	christophe.delord.free.fr /en/tpg (689 words)

	Parser and Scanner Generators (Site not responding. Last check: 2007-11-01)
		This is the standard gnu bison with a number of improvments, license-free parsers for C and C++, only one external symbol for each grammar, permits multiple grammars per application, better error reports on the grammar.
		Ratatosk is a SLR parser generator in Gofer (a Haskell variant) that generates purely functional parsers (also in Gofer).
		It generates a recursive parser for LL (1) grammars and the respective scanner.
	students.si.fct.unl.pt /users/pjmlp/en/parserscan.html (1303 words)

	Open Source Parser Generators in Java
		A parser generator is a tool that reads a grammar specification and converts it to a Java program that can recognize matches to the grammar.
		RunCC is a new kind of parsergenerator that generates parsers and lexers at runtime.
		The toolkit also supports generating Java parsers for all the bottom-up parsing methods, based on a CUP definition (similar to Yacc and CUP, but not restricted to LALR parsers only).
	java-source.net /open-source/parser-generators (536 words)

	BNF Parser Generator
		The BNF parser generator takes a syntax not unlike BNF and generates a "C" parser for it, a parser that can parse either strings or files.
		With the IO rule we handle the input that the generated parser reads and the output it produces.
		A fundamental property of parsers generated with BNF is that they are simple "C" functions, so you can intermix calls to ordinairy "C" functions that you define yourself within the grammar.
	www.nongnu.org /bnf (659 words)

	Parser
		Because the parser uses top-down parsing, writing grammars is trickier than with bottom-up parsing.
		The lexer is built using the lexer generator.
		The parser generator seems to work fine when the grammar is LL(1).
	www-sal.cs.uiuc.edu /~kamin/Jr/parser.html (995 words)

Try your search on: Qwika (all wikis)