Appel, Andrew W., Mattson, James S., and Tarditi, David R. A lexical analyzer generator for Standard ML. (December 1989). Distributed with Standard ML of New Jersey.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the description file appears in. Suppose we have a group consisting of a.sml and b.sml, which needs to refer to a subgroup containing util c.sml and util d.sml. In this case we could create a description file util sources.cm with: 5 .sig .sml .fun Sml .grm .y MLYacc [TA90] lex . l MLLex [AMT89] .burg MLBurg [GG93] v RCS [Tic85] cm CMFile .sc SCGroup .nw Noweb Table 1: Default mapping from name suffixes to member classes Group is c.sml d.sml and another one called sources.cm specifying: Group is a.sml b.sml util sources.cm 5.3 Tools and member classes Sometimes a ....

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, December 1989.

....Unless anchored using the path anchor mechanism (see Section 3.3) the command ml yacc will be located using the operating system s path search mechanism (e.g. the PATH environment variable) 7.2. 2 ML Lex The ML Lex tool governs files that are input to the ML Lex lexical analyzer generator [AMT89]. Its class name is mllex. Recognized file name suffixes are .lex and .l. For a source file f , the tool produces one targets f.sml which will always be treated as ML source code. Tool parameters are passed on without change to that file. The tool invokes the ml lex command if the target is ....

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, December 1989.

....and translated into a functional program by a scanner or parser generator or (2) the specification is composed from a set of combinators provided by a scanner or parser combinator library. Both approaches have their advantages and were pursued in the past. There are a couple of generators (e.g. [8,2,5]) for widely used languages, such as Haskell and SML, as well as a number of combinator libraries (e.g. 3,4] Usually, generators produce more efficient scanners and parsers by implementing table driven analysers [1] but this is, in the case of parsers, at the expense of expressiveness, as ....

Andrew W. Appel, James S. Mattson, and David R. Tardit. A lexical analyzer generator for Standard ML. http://cm.bell-labs.com/cm/cs/what/smlnj/doc/MLLex /manual.html, 1994.

....the implementation of rewrite rules have been illustrated in section 2.2. 2, and it is not dicult to compile the appropriate C code from the speci cation using compiler compiler techniques, such as those of the Unix system [40, 44] or some other environment, e.g. Standard ML of New Jersey [6, 7]. The most dicult part of the compilation will be the semantic processing to guarantee that the speci cation rewrite rules possess the termination and con uence properties that make the direct implementation work. This could be eased by the syntax of the speci cation language. For example, by ....

A. W. Appel, J. S. Mattson, and D. R. Tarditi. A lexical analyzer generator for Standard ML. Princeton University, December 1989.

....list) trans Figure 10: A funs section for CCS. 16 rels transitions : agent env) id set env) agent act agent bool diverges : agent env) id set env) agent bool aut trans : automaton act automaton bool Figure 11: A rels section for CCS. inputs transitions is [1,2,3] diverges is [1,2,3] aut trans is [1] Figure 12: An inputs section for CCS. 3.4 Semantic Relation Declarations The rels and inputs sections contain information about each semantic relation to be de ned or used in the SOS rules of the semantic component of the language description. Like ....

....10: A funs section for CCS. 16 rels transitions : agent env) id set env) agent act agent bool diverges : agent env) id set env) agent bool aut trans : automaton act automaton bool Figure 11: A rels section for CCS. inputs transitions is [1,2,3] diverges is [1,2,3] aut trans is [1] Figure 12: An inputs section for CCS. 3.4 Semantic Relation Declarations The rels and inputs sections contain information about each semantic relation to be de ned or used in the SOS rules of the semantic component of the language description. Like constructors the relations ....

[Article contains additional citation context not shown here]

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for standard ml. Included in Standard ML of New Jersey Distribution.

....AST node types. 5. SML functions for accessing various properties of nodes, such as the type of an expression node or a list of any node s children. The generated C serialization code is incorporated into the Titanium compiler. The ML Lex and ML Yacc deserialization code is translated to SML [7, 22], and together with the other generated SML code, forms the SML Titanium front end. Given a serialized AST from the Titanium compiler, the SML Titanium front end reconstitutes an equivalent representation within the SML universe, ready for traversal and Bane constraint generation. Because so much ....

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML. Department of Computer Science, Princeton University, October 1994.

....event incorporates broadcast synchronization which complements the existing CML synchronization facilities. 12 Currently we have a prototype implementation that has been used to experiment with the ideas presented in this paper. The implementation consists of a parser which utilizes sml lex [AMT94] and sml yacc [TA94] and a run time system module that extends CML with support for FCS. Our modules consist of approximately 2000 lines of ML code. With the introduction of concurrency into mainstream languages like Java [GJS96] concurrency has manifested itself as being useful for a broad ....

A. W. Appel, J. S. Mattson, and D. R. Tarditi. A lexical analyzer generator for Standard ML.version 1.6.0. October 1994.

....Calculus of Communicating Systems, processing a sample session input. Leroy An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Lexgen A lexical analyser generator, implemented by James S. Mattson and David R. Tarditi [3], processing the lexical description of Standard ML. ML The SML NJ compiler compiling the Leroy benchmark. Modula A compiler translating a Modula like language [23] into GNU C. The input is a 1400 line source program. PIA The Perspective Inversion Algorithm [28] decides the location of an ....

Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

....first order functions 4.2.1 Domain specific tools The MSL Compiler MSL MSL compiler ADL CRML The MSL compiler translates the domain specific Message Specification Language (MSL) to ADL. It uses traditional compiler generation technology to do lexical analysis and parsing (ML yacc [51] and ML lex [2], which are distributed with the SML NJ distribution) The typechecker and code generation sections are written by hand, with some use of CRML s capability for automatic generation of control structures from datatype declarations. The generated code is expressed in ADL, a high level functional ....

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML, May 1994. Distributed as documentation with ML-Lex. 19

....Example Group is a.sml b.sml # if (SMLNJ VERSION = 109 defined(structure SMLofNJ) util.sml # elif (SMLNJ VERSION 108) # error The version of SML NJ is too old for this software. # else util workaround.sml # endif A.4 Default classes .sig .sml .fun Sml .grm .y MLYacc [TA90] lex . l MLLex [AMT89] burg MLBurg [GG93] v RCS [Tic85] cm CMFile .nw Noweb A.5 Available tools Items shown are predefined tools in CM s extensible toolbox. The out of date condition mentioned here refers to the situation where at least one of the targets is either missing or older than the source. member ....

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, December 1989.

....prime number generator written by John Reppy [Rep91] KB Comp 655 1 1 An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Lexgen 1185 5 1 A lexical analyzer generator, implemented by James S. Mattson and David R. Tarditi [AMT89] processing the lexical description of Standard ML. Life 148 1 1 The game of Life, written by Chris Reade and described in his book [Rea89] running 50 generations of a glider gun. Ray 874 5 5 A simple ray tracer written in C by Don Mitchell, translated into Standard ML by John Reppy. Simple ....

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, December 1989.

....implementation of rewrite rules have been illustrated in section 2.2. 2, and it is not difficult to compile the appropriate C code from the specification using compiler compiler techniques, such as those of the Unix system [40, 44] or some other environment, e.g. Standard ML of New Jersey [6, 7]. The most difficult part of the compilation will be the semantic processing to guarantee that the specification rewrite rules possess the termination and confluence properties that make the direct implementation work. This could be eased by the syntax of the specification language. For example, ....

A. W. Appel, J. S. Mattson, and D. R. Tarditi. A lexical analyzer generator for Standard ML. Princeton University, December 1989.

....of rewrite rules have been discussed in detail in section 2.2. 2, and it is not difficult to compile the appropriate C code from the specification using compiler compiler techniques, such as those of the Unix system [38, 42] or some other environment, e.g. Standard ML of New Jersey [6, 7]. The most difficult part of the compilation will be the semantic processing to guarantee that the specification rewrite rules possess the termination and confluence properties that make the direct implementation work. Wherever possible, we will try to convert semantic properties to syntax ....

A. W. Appel, J. S. Mattson, and D. R. Tarditi. A lexical analyzer generator for Standard ML. Princeton University, December 1989.

....42.44 18.2 41.58 19.9 Figure 7: SPARC running time in seconds and speedup relative to sm10. Yacc A LALR(1) parser generator, implemented by David R. Tarditi [21] processing the grammet of Standard ML. Lexgen A lexical analyzer generator, implemented by James S. Mattson and David R. Tarditi [7], processing the lexical description of Stan dard ML. Knuth B An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Simple A spherical fluid dynamics program, developed as a realistic FORTRAN benchmark [11] translated into ....

Appel, Andrew W., Mattson, James S., and Tarditi, David R. A lexical analyzer generator for Standard ML. (December 1989). Distributed with Standard ML of New Jersey.

....in an extended version of Standard ML. Knuth Bendix An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Lawrence Livermore Loops Lexgen A lexical analyzer generator, implemented by James S. Mattson and David R. Tarditi [5], processing the lexical description of Standard ML. Life The game of Life, written by Chris Reade [40] running 50 generations of a glider gun. It is implemented using lists. Pseudoknot Computes the three dimensional structure of part of a nucleic acid molecule [23] PIA A perspective ....

Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

....Systems. The input is the sample session from Section 7.5 of [15] Knuth Bendix An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Lexgen A lexical analyzer generator, implemented by James S. Mattson and David R. Tarditi [7], processing the lexical description of Standard ML. Life The game of Life, written by Chris Reade [40] running 50 generations of a glider gun. It is implemented using lists. PIA The Perspective Inversion Algorithm [47] decides the location of an object in a perspective video image. Simple A ....

Appel, A. W., Mattson, J. S., and Tarditi, D. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

....Systems. The input is the sample session from Section 7.5 of [8] Knuth Bendix An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Lexgen A lexical analyzer generator, implemented by James S. Mattson and David R. Tarditi [4], processing the lexical description of Standard ML. Life The game of Life, written by Chris Reade [25] running 50 generations of a glider gun. It is implemented using lists. PIA A perspective inversion algorithm [32] deciding the location of an object in a perspective video image. Simple A ....

Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

....be stored in the list cell, rd contains the pointer to the next list cell, alloc is the address of the next free word in the allocation area, and top contains the end of the allocation area. 2. 4 Garbage collection in SML NJ The SML NJ compiler uses a simple generational copying garbage collector [Appel 1989]. Memory is divided into an old generation and an allocation area. New objects are created in the allocation area; garbage collection copies the live objects in the allocation area to the old generation, freeing up the allocation area. Generational garbage collection relies on the fact that most ....

....include inlining, passing function arguments in registers, register targeting, constant folding, code hoisting, uncurrying, and instruction scheduling. The most controversial design decision in the compiler was to allocate procedure activation records on the heap instead of the stack [Appel 1987; Appel and Jim 1989]. In principle, the presence of higher order functions means that procedure activation records must be allocated on the heap. With a suitable analysis, a stack can be used to store most activation records [Kranz et al. 1986] However, using only a heap simplifies the compiler, the run time system ....

[Article contains additional citation context not shown here]

Appel, A. W., Mattson, J. S., and Tarditi, D. 1989. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey.

....class continuations. Program Description CW The Concurrency Workbench [12] is a tool for analyzing networks of finite state processes expressed in Milner s Calculus of Communicating Systems. Leroy An implementation of the Knuth Bendix completion algorithm. Lexgen A lexical analyzer generator [6], processing the lexical description of Standard ML. Life The game of Life implemented using lists [32] PIA The Perspective Inversion Algorithm [36] decides the location of an object in a perspective video image. Simple A spherical fluid dynamics program [13] VLIW A Very Long Instruction Word ....

Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

....any loss of accuracy [6] 3 The code size includes 207K for the standard libraries. Program Description CW The Concurrency Workbench [4] is a tool for analyzing networks of finite state processes expressed in Milner s Calculus of Communicating Systems. Lexgen A lexical analyzer generator [2], processing the lexical description of Standard ML. PIA The Perspective Inversion Algorithm [11] decides the location of an object in a perspective video image. Simple A spherical fluid dynamics program [5] VLIW A Very Long Instruction Word instruction scheduler. YACC An implementation of an ....

Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

....Systems. The input is the sample session from Section 7.5 of [8] Knuth Bendix An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Lexgen A lexical analyzer generator, implemented by James S. Mattson and David R. Tarditi [4], processing the lexical description of Standard ML. Life The game of Life, written by Chris Reade [25] running 50 generations of a glider gun. It is implemented using lists. PIA A perspective inversion algorithm [32] deciding the location of an object in a perspective video image. Simple A ....

APPEL, A. W., MATTSON, J. S., AND TARDITI, D. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

....42.44 18.2 41.58 19.9 Figure 7: SPARC running time in seconds and speedup relative to sml0. Yacc A LALR(1) parser generator, implemented by David R. Tarditi [21] processing the grammer of Standard ML. Lexgen A lexical analyzer generator, implemented by James S. Mattson and David R. Tarditi [7], processing the lexical description of Standard ML. Knuth B An implementation of the Knuth Bendix completion algorithm, implemented by Gerard Huet, processing some axioms of geometry. Simple A spherical fluid dynamics program, developed as a realistic FORTRAN benchmark [11] translated into ....

Appel, Andrew W., Mattson, James S., and Tarditi, David R. A lexical analyzer generator for Standard ML. (December 1989). Distributed with Standard ML of New Jersey.

....with subblock placement. Program Description CW The Concurrency Workbench [12] is a tool for analyzing networks of finite state processes expressed in Milner s Calculus of Communicating Systems. Leroy An implementation of the Knuth Bendix completion algorithm. Lexgen A lexical analyzer generator [6], processing the lexical description of Standard ML. Life The game of Life implemented using lists [33] PIA The Perspective Inversion Algorithm [37] decides the location of an object in a perspective video image. Simple A spherical fluid dynamics program [13] VLIW A Very Long Instruction Word ....

Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

No context found.

Andrew W. Appel, James S. Mattson, and David R. Tarditi. A lexical analyzer generator for Standard ML. Online documentation distributed with SML/NJ, 1989.

No context found.

Andrew W. Appel, James S. Mattson, and David Tarditi. A lexical analyzer generator for Standard ML. Distributed with Standard ML of New Jersey, 1989.

First 50 documents

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC