Synonyms for parser_generator or Related words with parser_generator

yacc              antlr              haxe              actionscript              emacs_lisp              sequencel              cython              ocaml              coffeescript              llvm              glasgow_haskell_compiler              nemerle              clojure              common_lisp              python_ruby              applescript              freebasic              rexx              wxwidgets              sqlite              compiler_compiler              python_bindings              tcl_tk              vb_net              modula              perl_perl              java_bytecode              fltk              systemc              vhdl              pl_sql              cfml              verilog              gnu_octave              automake              toolchain              object_pascal_delphi              scilab              jython              jit_compiler              ratfor              glibc              scannerless              gui_toolkit              ecmascript              jquery              javacc              https_github_com              gobject              gnu_guile             



Examples of "parser_generator"
PackCC is a parser generator for C. Its main features are as follows:
An early LALR parser generator was called "TWS", created by Frank DeRemer and Tom Pennello.
Ragel is a finite-state machine compiler and a parser generator.
The parser itself is generated from a parsing expression grammar (PEG) using the Rats! parser generator.
TreeDL can be used with any parser generator that allows custom actions during parsing (for example, ANTLR, JavaCC).
Grammatica is a C# and Java parser generator. Its strength is its separation of grammar and other source code.
ANTLR Studio is an IDE for the ANTLR parser generator. It plugs into the Eclipse development environment.
Version 7.5 contains http server and LALR(1) parser generator (see also New Features in Visual Prolog 7.5).
It is the name of both the programming language and the LALR parser generator system (or TWS: translator writing system) based on the language.
The parse tables are much larger than the grammar. LR tables are hard to accurately compute by hand for big grammars. So they are mechanically derived from the grammar by some parser generator tool like Bison.
Because a parser combinator-based program is generally slower than a parser generator-based program, Parsec is normally used for small domain-specific languages, while Happy is used for compilers such as GHC.
The ALGOL 68-R compiler was initially written in a local dialect of ALGOL 60 with extensions for address manipulation and list processing. The parser was written using J.M. Foster's Syntax Improving Device (SID) parser generator.
The Scannerless Boolean Parser is an open source scannerless GLR parser generator for boolean grammars. It was implemented in the Java programming language and generates Java source code. SBP also integrates with Haskell via LambdaVM.
The partially parsed rules for a state are called its "core LR(0) items". The parser generator adds additional rules or items for all the possible next steps in building up the expected Products:
Bison was originally written by Robert Corbett in 1988. Later, in 1990, Robert Corbett wrote another parser generator named Berkeley Yacc. Bison was made Yacc-compatible by Richard Stallman.
Yacc (Yet Another Compiler Compiler) is a computer program for the Unix operating system. It is a Look Ahead Left-to-Right (LALR) parser generator, generating a parser, the part of a compiler that tries to make syntactic sense of the source code, specifically a LALR parser, based on an analytic grammar written in a notation similar to Backus–Naur Form (BNF). Yacc itself used to be available as the default parser generator on most Unix systems, though it has since been supplanted as the default by more recent, largely compatible, programs.
Lexers are often generated by a "lexer generator", analogous to parser generators, and such tools often come together. The most established is lex, paired with the yacc parser generator, and the free equivalents flex/bison. These generators are a form of domain-specific language, taking in a lexical specification – generally regular expressions with some markup – and emitting a lexer.
Well-known examples of declarative domain-specific languages (DSLs) include the yacc parser generator input language, the Make build specification language, Puppet's configuration management language, regular expressions, and a subset of SQL (SELECT queries, for example). DSLs have the advantage of being useful while not necessarily needing to be Turing-complete, which makes it easier for a language to be purely declarative.
XPL is a programming language based on PL/I, a portable one-pass compiler written in its own language, and a parser generator tool for easily implementing similar compilers for other languages. XPL was designed in 1967 as a way to teach compiler design principles and as starting point for students to build compilers for their own languages.
Dwayne Richard Hipp (born April 9, 1961) is the architect and primary author of SQLite as well as the Fossil SCM. He and his wife, Ginger G. Wyrick, currently live and work in Charlotte, North Carolina. He also authored the Lemon Parser Generator and CVSTrac. CVSTrac became the inspiration for Trac. He was also a member of the Tcl core team.