Bentley, J. L. MoreProgramming Pearls. Addison-Wesley, Reading, Massachusetts, 1988.  @ NUS  Home/Search   Document Not in Database   Summary   Related Articles   Check

....cut at many of the issues we are aware of the possible inefficiencies, e.g. in the AFS implementation of channel files. Also, the application run is susceptible to single point failures. However, we follow the maxim Make it work first before you make it work fast (B. Whiteside, quoted in [2]) and expect to resolve these issues after the implementation proves the worth of the overall concept. Future research related to the Gemini project will therefore address both the fundamental issues and practical use of the framework. Our first intention is to look at the patterns of behavior of ....

Bentley, J. L.: More Programming Pearls. Addison-Wesley, 1988.

....type rules and other veri cation conditions; describe language speci c compiler optimizations; and so forth. The mechanism described in this dissertation scales in a natural manner to allow such speci cations. Authors have described domain speci c or little languages for decades. Bentley [4] was especially in uential in presenting the notion of language as an abstraction that programmers can use to e ectively construct software. Unfortunately, his work and much of the literature that follows it has never established precise mechanisms for describing and reusing such languages. This ....

Bentley, J. L. More Programming Pearls. Addison-Wesley, 1988.

....is both challenging and a landmark. There are places where people have collected together some of the especially neat and clever little programs they have come across, and many of these indeed contain ideas or lessons that may be re cyclable. Such examples have come to be referred to as pearls [2][3]. Once one has worked out what program needs to be written ideas (now so much in the mainstream that this book is perhaps now out of date) can be found in one of the big presentations by some of the early proponents of structured programming[11] Stepping back and looking at the programming ....

Jon Bentley. MoreProgramming Pearls. Addison-Wesley, 1988. 46

....is available, for example, from the gpic man page, part of the GNU gro package. Examples of use of the circuit macros in an electronics course are available on the web[2] For a discussion of the use of little languages in document production, and of pic in particular, see Chapter 9 of [1]. Chapter 1 of [4] also contains a brief discussion of this and other languages. Section 9 of this document describes how to overcome the problem mentioned in [4] of determining the dimensions of typeset text in diagrams. 3.2 The linear objects: line, arrow, spline, arc A line can be drawn as ....

J. Bentley. More Programming Pearls. Addison-Wesley, Reading, Massachusetts, 1988.

....in accordance with a model of its design. If an inconsistency between a trace and the specified behavior is discovered, then the model or the code can be corrected as appropriate. For example, Bentley describes the use of monitoring statements in the implementation of a binary search program [10]. In one test case, the input and output of the program are correct, but inconsistencies between the intermediate values of the upper and lower indexes in the execution trace lead him to discover the error in the code. This form of debugging is common and informal, but relies on the existence of ....

Bentley, J., More Programming Pearls. 1988, New York: Addison-Wesley.

....to decrease the storage requirements of the program without compromising the structure of the recursive procedures too much. Run time may also improve. This is in contrast with the various transformations suggested in the literature to eliminate recursion from programs. The reader is referred to [1, 2] for some discussion and references on code improvement in general, and on recursion elimination in particular. Acknowledgments: Discussions with Thomas Ungar helped interpret the impact of the architecture on the experimental results. ....

J. Bentley, More Programming Pearls, Addison-Wesley, 1988. 3 The speedup was even better on the Silicon Graphics R4400 --- between 1.5 to 2.3.

....12 12 270 0.8 black) text 342 228 32 black 6x12 ) text 362 228 64 black 6x12 ) text 382 228 128 black 6x12 ) postscript pies W. psf ) Figure 5: Ezd for pie charts 8 More examples and a discussion of the virtues of little languages for specifying documentation graphics are found in [6]. DON T FIDGET WITH WIDGETS, DRAW N Central California DISC ZONE WARN EXTEND HELP QUIT CLOUDY AND BREEZY. SNOW LEVEL AS LOW AS 1000 TO 2000 FEET. HIGHS IN THE 50S AND LOWER 60S. NORTHWEST WIND 15 TO 25 MPH WITH OCCASIONAL HIGHER GUSTS ALONG THE COAST AND IN THE HILLS THIS MORNING. ....

Jon Bentley. More Programming Pearls. Addison-Wesley Publishing Company, Inc., 1988.

....efficiency: A choice of an algorithm for solving a problem is critical for software efficiency. The classical example of simple improvements of a simple algorithm (for selecting prime numbers) that finally result in the cutting execution time by a factor of several thousands can be found in [Ben88] A well known rule of thumb says that 20 of code accounts for 80 of execution time. This critical part of the code may be easily identified with the help of a profiler. Those two arguments (together with continuous improvements of code optimization provided by compilers) suggest that ....

J. Bentley, More Programming Pearls, Confessions of a Coder, Addison-Wesley, New York, 1988.

....in accordance with a model of its design. If an inconsistency between a trace and the specified behavior is discovered, then the model or the code can be corrected as appropriate. For example, Bentley describes the use of monitoring statements in the implementation of a binary search program [6]. In one test case, the input and output of the program are correct, but inconsistencies between the intermediate values of the upper and lower indexes in the execution trace lead him to discover the error in the code. This form of debugging is common and informal, but relies on the existence of ....

Bentley, J., More Programming Pearls. 1988, New York: Addison-Wesley.

....its own right, it has found and important role as a scripting language embedded in an application. Guile and STK are two examples of embeddable Schemes implemented in C [16] Beckman argues that scripting languages are inevitable [5] In the 80 s Jon Bently popularized the idea of Little Languages [17]. Such a language can be used to describe in a compact way, one aspect of your project, graphical layout for example. Beckman argues that this decoupling of aspects is essential, because the only other option is to keep changing all the source code. He also argues that little languages often grow ....

J.L. Bentley, More Programming Pearls, Addison-Wesley, Reading, MA, 1988.

....not only by integers, but by strings, reals, tables, and function values. Associative arrays are a powerful language construct; many algorithms are simplified to the point of triviality because the required data structures and algorithms for searching them are implicitly provided by the language [Ben88] Most typical data containers, like ordinary arrays, sets, bags, and symbol tables, can be directly implemented by tables. Tables can also implement records by simply using field names as indices. Lua supports this representation by providing a.name as syntactic sugar for a[ name ] Tables are ....

J. Bentley. More programming pearls. Addison-Wesley, 1988.

....do not explicitly advance simulated time. HOST HOST SINK SOURCE FTP FTP ROUTER SWITCH ROUTER LINK Figure 3.7. Minimum VCSIM network configuration 3.5. Input to VCSIM The behavior of VCSIM is controlled by a specification file containing parameter settings in the form of name value pairs [7]. Figure 3.8 is a sample specification file. It describes the network in Figure 3.7, with two hosts, two routers, one switch, and four links. Related parameters are grouped into blocks, for instance the block delimited by router and router end. Parameters have default values, so that a partial ....

....in case we need to revisit an earlier experiment to explore some aspect in more detail. With VCSIM, the combination of an output file and the corresponding input file uniquely identify a simulation run. In our study, we saved both files to provide our results with the necessary provenances [7]. Incidentally, this ability to exactly reproduce previous conditions is another advantage of simulation over experiments with a real network. 4.4. Simulation Results We are now ready to evaluate different traffic multiplexing policies through simulation. As described in the previous section, we ....

J. L. Bentley, More Programming Pearls, Addison-Wesley, Reading, Massachusetts, 1988.

....but with strings, reals, tables, and function values. Associative arrays Associative arrays are a powerful language construct; many algorithms are simplified to the point of triviality because the required data structures and algorithms for searching them are implicitly provided by the language [9]. Most typical data containers, like ordinary arrays, sets, bags, and symbol tables, can be directly implemented by tables. Tables can also simulate records by simply using field names as indices. Lua supports this representation by providing a.name as syntactic sugar for a[ name ] Unlike ....

J. Bentley, More programming pearls, Addison-Wesley, 1988.

....not only by integers, but by strings, reals, tables, and function values. Associative arrays are a powerful language construct; many algorithms are simplified to the point of triviality because the required data structures and algorithms for searching them are implicitly provided by the language [3]. Most typical data containers, like ordinary arrays, sets, bags, and symbol tables, can be directly implemented by tables. Tables can also implement records by simply using field names as indices. Lua supports this representation by providing a.name as syntactic sugar for a[ name ] As an ....

....can also be used to built lists, with the syntax exp1, exp2, This expression creates a new table, and stores in each field i the result of expi. Therefore, after the assignment: days = Sunday , Monday , Tuesday , Wednesday , Thursday , Friday , Saturday the expression days[3] will result in the string Tuesday . Because functions are first class values, table fields can refer to functions. This property allows the implementation of some interesting object oriented facilities, which are made easier by syntactic sugar. Method definitions can be written like function ....

J. Bentley. More programming pearls. Addison-Wesley, 1988.

.... with higher order functions Haahr Rakitzis let (cd = fn cd) fn cd cd title pwd Spoofing can also be used for tasks which other shells cannot do; one example is timing each element of a pipeline by spoofing pipe, along the lines of the pipeline profiler suggested by Jon Bentley [7]; see Figure 1. let (search = fn pathsearch) fn pathsearch prog let (file = search prog ) if #file 1 file path cache = path cache prog fn prog = file return file fn recache for (i = path cache) fn i = path cache = Figure 2: Path caching fn ....

Jon L. Bentley, More Programming Pearls, Addison-Welsey, 1988.

....this problem arises because keywords like if are not reserved, and can be used in other contexts; most modern languages have avoided this particular difficulty. While compilation of PL I is no longer a hot topic, this same problem still arises when compiling little, or domain specific languages [3]. More generally, we do not restrict ourselves to keywords, and consider any situation where a token s type is context dependent. One language may be embedded within another, as SQL can be embedded within C, C , or COBOL; the interpretation of tokens may vary greatly between an SQL construct and ....

Bentley J. Little languages. More Programming Pearls. Addison-Wesley, 1988; 83--100.

No context found.

Bentley, J. L. MoreProgramming Pearls. Addison-Wesley, Reading, Massachusetts, 1988.

No context found.

J. Bentley, More Programming Pearls, Addison-Wesley, Reading, MA, 1988.

No context found.

J.L. Bentley, More Programming Pearls, Addison-Wesley, Reading, MA, 1988, Column 9.

No context found.

J. Bentley; More programming pearls; Addison-Wesley, 1988.

No context found.

Jon Bentley. More Programming Pearls. Addison-Wesley, 1988.

No context found.

Bentley, J. L. More Programming Pearls. Addison-Wesley, Reading, Massachusetts, 1988.

No context found.

Bentley, J.L., More Programming Pearls, Addison-Wesley, Menlo Park, California, 1988.

No context found.

Bentley, J. L. More Programming Pearls. Addison-Wesley, Reading, Massachusetts, 1988.

No context found.

Bentley, J. L. More Programming Pearls, 1988.

No context found.

J. Bentley, More programming pearls, Addison-Wesley, 1988.

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

CiteSeer.IST at NUS - Copyright Penn State and NEC. Hosted by the School of Computing, National University of Singapore.