PRECCX
(Pre-C-Compiler eXtended) An infinite-lookahead compiler-compiler by Peter Breuer for context dependent grammars. PRECCX generates ANSI C. Specification scripts are in very EBNF with {inherited attributes} and {synthetic attributes} allowed. Scripts can be compiled in separate modules and linked later. Meta-production rules are allowed. Grammars can be essentially LL(oo) with optimisations. A converter for yacc scripts is available. Versions 1.xx were known as "PRECC" and only had unbounded lookahead. The 2.xx series added the "X" for "extended" and featured higher order parameterisation (inherited attributes). Version 2.42 integrates inherited and synthesized attributes by using a "monadic" model for parsing. You can now synthsize attributes during the pass and inherit them in the remainder, e.g. @ foo = barx gum(x) synthesises an x in bar and passes it down into gum as a parameter. Useful for @ what = ?x did_you_say(x), for example. It now compiles into C instead of running an interpreter at parse-time. Version 2.42 runs under Unix and MS-DOS. Start . E-mail: Peter Breuer , Jonathan Bowen . ["The PRECC Compiler-Compiler" by P.T. Breuer and J.P. Bowen. In E. Davies and A. Findlay (eds.), Proc. UKUUG/SUKUG Joint New Year 1993 Conference, St. Cross Centre, Oxford, UK, 6-8 January 1993, ISBN 1 873611 06 4 (UKUUG), 0 9520700 0 6 (SUKUG) UKUUG/SUKUG Secretariat, Owles Hall, Buntingford, Herts SG9 9PL, UK, pp 167-182, 1993]. (2000-04-24) In addition suitable contents:
[ 2 ] [ = ] [ @ ] [ ad ] [ ai ] [ al ] [ am ] [ an ] [ ANS ] [ ANSI ] [ ANSI C ] [ ar ] [ arc ] [ archive ] [ as ] [ at ] [ attribute ] [ av ] [ B ] [ b ] [ ba ] [ bar ] [ be ] [ BNF ] [ bo ] [ bounded ] [ by ] [ C ] [ ca ] [ cat ] [ cc ] [ ch ] [ ci ] [ co ] [ com ] [ compiler ] [ Compiler-Compiler ] [ compiler-compiler ] [ con ] [ context ] [ cr ] [ D ] [ dd ] [ de ] [ ding ] [ do ] [ DOS ] [ down ] [ du ] [ E ] [ EBNF ] [ ec ] [ ECC ] [ ed ] [ eg ] [ er ] [ era ] [ es ] [ et ] [ extend ] [ feature ] [ fi ] [ file ] [ finite ] [ fo ] [ for ] [ G ] [ ge ] [ gen ] [ generate ] [ gf ] [ gh ] [ gr ] [ grammar ] [ gu ] [ h ] [ hat ] [ hr ] [ hs ] [ ht ] [ id ] [ ie ] [ il ] [ in ] [ infinite ] [ int ] [ interpreter ] [ io ] [ IS ] [ is ] [ it ] [ J ] [ K ] [ ke ] [ kn ] [ la ] [ Lex ] [ li ] [ link ] [ LL ] [ ly ] [ M ] [ ma ] [ mail ] [ meter ] [ ml ] [ mm ] [ mo ] [ mod ] [ mode ] [ model ] [ module ] [ monad ] [ monadic ] [ mp ] [ MS-DOS ] [ N ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ nl ] [ nn ] [ no ] [ ns ] [ NSI ] [ nu ] [ O ] [ om ] [ op ] [ OS ] [ Owl ] [ Ox ] [ pa ] [ param ] [ parameter ] [ parsing ] [ pe ] [ ph ] [ pl ] [ PR ] [ pr ] [ product ] [ pt ] [ query ] [ rc ] [ RE ] [ re ] [ REC ] [ rete ] [ ro ] [ ru ] [ run ] [ S ] [ sa ] [ say ] [ sc ] [ script ] [ se ] [ SI ] [ si ] [ Spec ] [ st ] [ sy ] [ synthesis ] [ T ] [ tar ] [ text ] [ th ] [ tm ] [ to ] [ tool ] [ tp ] [ tr ] [ tt ] [ ua ] [ uk ] [ UKUUG ] [ um ] [ us ] [ V ] [ va ] [ ve ] [ vi ] [ X ] [ Xt ] [ Y ] [ yacc ]
[ Go Back ]
Free On-line Dictionary of Computing Copyright © by OnlineWoerterBuecher.de - (9620 Reads) |
