The ANDF page is:
At the end of the page there is a link to "List of ANDF Papers", which includes the ANDF/TDF specification.
At the Grenoble OSF RI we have participated in the development of an ANDF interpreter. This was described at the ACM IR'95 workshop on intermediate languages - the paper "Validation of ANDF Components" is available at URL:
Please contact me if you are interested in using this tool.
James (email@example.com (James Loveluck))
Newsgroups: comp.compilers From: firstname.lastname@example.org (Christian Collberg) Subject: Linking References Available Keywords: linker, bibliography Organization: University of Auckland Date: 30 Oct 1994 23:49:44 MET I'm maintaining a list of references to linking: http://cs.aukuni.ac.nz/~collberg/Research/References/linking.html Currently there are 54 BibTeX entries. Additions/corrections are welcome. Enjoy, Christian -- ___________________________________________________________________________ Christian Collberg | Email: email@example.com Computer Science Department | Fax: +64-9-373-7453 University of Auckland | Phone: +64-9-373-7599 x 6137
Check out http://acaps.cs.mcgill.ca/ftp/ftp.html
[..] an enhanced version of yacc, which supports backtracking in the event of parse conflicts and inherited attributes. These are actually closely connected as inherited attributes in a bottom-up parse tend to introduce conflicts. The program is public domain and is available for ftp.
Newsgroups: comp.compilers From: "Ronald F. Guilmette" <firstname.lastname@example.org> Subject: Reliability (was: Re: Optimizing Across && And ||) Keywords: optimize, design, testing Organization: a2i network Date: 16 Mar 1995 19:46:33 MET David Keppel <email@example.com> wrote: > >Opinion alert: >... [Stuff about why implementors spend so much time worring about their > SPECmark numbers deleted]... > >I think we're starting to see changes here already, but it's an >uphill battle to sell reliability...Tell me about it! I sell compiler test suites for C and C++. It's a hard sell, even at the best of times, even though I price these things dirt cheap (relative to what it would cost for the compiler vendors to reproduce even a small fraction of my test cases).
I even had a guy at one local semiconductor firm say to me once "If we buy your test suite, then we will find some more bugs in our compiler. So what?"
I kid you not! This is really what he said.
>... which is unpleasant to talk about...
Compiler quality is only unplesant to talk about for those folks that don't have it. (I could name names here, but I won't.)
>... and hard to measure.
Rubbish! I've developed sophisticated automated techniques for producing randomized compiler test cases that root out even the most subtle compile- time bugs. Free samples are available for anonymous ftp in the files:
If you want to see your favorite C compiler screw up and give errors on some perfectly valid C code (and maybe even give up the ghost) just try compiling these examples. They found bugs in every one of the 20+ C compilers I've tried then on so far (although some verdors have since fixed the bugs which are triggered by my test cases).
Suggestion: If you try these test cases on some C compiler(s), I suggest disabling all warnings when doing the compiles. Any actual _errors_ that you get will be due to compiler bugs.
>Performance is less hard (but not easy) to measure and obviously desirable.
I can't remember who said it, but I am often reminded of a wonderful quote: "It is easy to get incorrect answers infinitely fast."
I got myself the two samples and submitted them to two ansi C compilers available here, gcc -ansi and Sun's acc. Only one case (sample.2 and gcc) resulted in a compiler crash. Here are the results:
Pascal-S is written in Pascal, and forms an excellent introduction to the art of designing small compilers. The best source for the paper is in an edited collection by Baron entitled `Pascal - the language and its implementation' I should think it is out of print now, but most university libraries should have a copy. A modified version was used by Ben-Ari in the first edition of his book on concurrency.
PS If you are interested in this kind of thing, you might like to join the mailing list for my RDP compiler-compiler which is a good way to start learning about recursive descent parsers. Send me a note if you want to find out more.
-- Dr Adrian Johnstone, Dean of the Science Faculty, Dept of Computer Science, Royal Holloway, University of London, Egham, Surrey, TW20 0EX, England. Email: firstname.lastname@example.org Tel: +44 (0)1784 443425 Fax: +44 (0)1784 443420
Newsgroups: comp.compilers From: email@example.com (Russell W Quong) Subject: Another backtracking parser generator: ANTLR. Keywords: parse, PCCTS, LL(1) Organization: Purdue University Engineering Computer Network Date: 30 Mar 1995 19:49:24 MET Along the subject of parser generators that produce backtracking parsers, please be aware of the current release (1.31) of ANLTR, which was developed by Terence Parr and myself. ANTLR - produces recursive-descent LL(k) parsers. In practice, k is limited to 3 or 4 depending on the grammar size. * allows the use of "predicates" to direct the parse. * Backtracking is goes under the name "syntactic predicate" - produces recursive-descent LL(k) parsers, which are easy to use/debug. * generates C++ code in the form of C++ parser classes, from which the user can subtype * it can also generate C code, though this option is showing its age. - has been a public-domain tool since the early 1990's, and is perhaps the most widely parser-generator after yacc/bison. - lexical analyzer support built in (no need for separate lexer file) - is part of the Purdue Compiler Construction Toolset (PCCTS) - has a newsgroup: comp.compilers.tools.pccts - has been ported to the PC/other platforms (see the newsgroup) - has an FTP-SITE = ftp://ftp.parr-research.com/pub/pccts - has technical papers * a user's manual [ in FTP-SITE/documentation/manual.ps ] (this manual is showing its age, but a book is being written). * a conference (1994 Intl Conf on Comp Constr) paper on predicates "Adding Semantic and Syntactic Predicates To LL(k): pred-LL(k)" [ in FTP-SITE/papers/predicates.ps.Z ] * a soon-to-appear article in Software Practice and Experience, "ANTLR: A Predicated-LL(k) Parser Generator" ( which we cannot give out until the article appears ) In both the conf. paper and SPE article, we give examples of how to use predicates and backtracking. In particular, we specifically show how get around the "lexer feedback hack" and how to parse C++ expressions and declaration via backtracking, as Chris Dodd mentioned in his btyacc posting (excerpted below).
Ulrich Neumerkel hat seine Diplomarbeit über Speicherbereinigung für Prologsysteme in HTML geschrieben (oder zumindest umgewandelt). Sehr löblich.
EEL: Machine-Independent Executable Editing
James R. Larus and Eric Schnarr
(To appear: PLDI '95, June 1995)
EEL (Executable Editing Library) is a library for building tools to analyze and modify an executable (compiled) program. The systems and languages communities have built many tools for error detection, fault isolation, architecture translation, performance measurement, simulation, and optimization using this approach of modifying executables. Currently, however, tools of this sort are difficult and time-consuming to write and are usually closely tied to a particu lar machine and operating system. EEL supports a machine- and system-independent editing model that enables tool builders to modify an executable without being aware of the details of the underlying architecture or operating system or being concerned with the consequences of deleting instructions or adding foreign code.