Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the database entry effectively changes history. To prevent this kind of thing, the database and archive are represented with write protected files, and editorial staff must be trained not to try to override it, lest the archives themselves be modified. The mechanized proofreader is an awk script[6] and simple parser which reads each article to compare it against a simple grammar, and also makes a pass through the article checking for certain kinds of consistency. For example, it checks to make sure that all identifiers are 14 characters or shorter (to accommodate some variants of Unix in ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger, The AWK Programming Language, Addison-Wesley, 1988.

....system directory. AWK is included in this set of tools. If you click on the MSDOS button in the GAMS IDE, a correct path is set up so that these utilities can be used without manually changing the path. 21.2. References. The o#cial reference for NETGEN is [4] The AWK language is described in [1]. 22. Importing GNETGEN network problems GNETGEN is a generator for Generalized Network problem instances based on the NETGEN generator described in the previous paragraph. It can be downloaded from http: www.netlib.org lp generators . The sample seed files contained data that made the ....

....an example see the previous section, where GAMS is called from Oracle using a Java Stored Procedure. The relevant code may look like: call gams String[ cmdArray = new String[5] Figure 5. GAMS ORAQUEUE Model Upload Facility cmdArray[0] C: Program Files GAMS 20.5 gams.exe ; cmdArray[1] = D: TMP trnsport.gms ; cmdArray[2] WDIR=D: TMP ; cmdArray[3] SCRDIR=D: TMP ; cmdArray[4] LO=2 ; Process p = Runtime.getRuntime( exec(cmdArray) p.waitFor( 10. SPAWNING GAMS FROM A WEB SERVER 105 Figure 6. GAMS ORAQUEUE Job Table Page 10. Spawning GAMS from a Web Server Running ....

[Article contains additional citation context not shown here]

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger, The AWK programming language, Addison-Wesley, 1988.

....in its basic form. The program can be run on UNIX systems by typing awk f micro tracer protocol where micro tracer is the file containing the Awk program, and protocol is the file with the transition rules defining the system to be analyzed. For an introduction to Awk see reference [3]. The first three lines of the tracer deal with the input. Data are stored in two arrays. The initial state of machine A is stored in array element proc[A] The transitions that machine A can make from state s are stored in move[A,s] All data are stored as strings, and most arrays are also ....

.... function run(state, i,str,moved) # 1 parameter, 3 local vars if (space[state] return # been here before level ; moved=0 for (i in proc) str = move[i,proc[i] while (str) v = substr(str, 1, index(str, sub(v, str) split(v, arr, if (arr[1] inp arr[3] = signal[arr[4] Level[level] i proc[i] v proc[i] arr[2] run(mkstate(k) unwrap(state) moved=1 else if (arr[1] out ) Level[level] i proc[i] v proc[i] arr[2] signal[arr[4] arr[3] run(mkstate(k) unwrap(state) moved=1 if ( moved) ....

[Article contains additional citation context not shown here]

Aho, A.V., Kernighan, B.W., Weinberger, P.J., "The AWK Programming Language," Addison-Wesley, 1988, 210 pgs.

.... effect of various types of search algorithms, for instance, Spin s partial order reduction techniques [7] Information on actions, input, and output events can be made available on the edges of the graph, by postprocessing the information generated by Spin with the help of a small Awk filter [1]. The example shown in Figure 6, is part of the reachable state space for a Spin verification model of our Paper Problem, for simplicity restricted to the sunny day scenario in which the author will not query the status of the submitted paper, and the referee will not consult with a peer before ....

A.V. Aho, B.W. Kernighan, P.J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988. Early Fault Detection Tools 13

....format stored in an object database. In PressPot, this data file takes the format of a multi line, tab separated text file. Code Generator The code that takes as input the Common Information and converts it into programming language source code. In PressPot, this takes the form of awk[1] scripts that read in tab separated files. There is one awk script for every type of code structure to be generated. Source Code The programming language source code that is incorporated into the source code of the application that is specific to each environment. In PressPot, this takes the ....

AHO, A. V., KERNIGHAN, B. W., AND WEINBERGER, P. J. The AWK Programming Language. Addison-Wesley, Reading, MA, USA, 1988. 8

....FREE. FREE uses a prebuilt index to identify the text data units which may contain a matching string and only examines these further. In this way, FREE shows orders of magnitude performance improvement in certain cases over standard regular expression matching systems, such as lex, awk and grep [18, 4]. 1 Introduction The amount of data in text databases and the world wide web continues to grow at a prodigious rate. This unprecedented increase in the size of modern datasets has made otherwise simple and well understood tasks challenging. A good instance of these challenges is the matching ....

....These observations are formalized in theorem 3.9 below. 5 Algorithm 3. 1 Multigram index Input: database Output: index: multigram index [1] k =1,expand = is a zero length string [2] While (expand is not empty) 3] k grams : all k grams in database whose (k 1) prefix expand [4] expand : 5] For each gram x in k grams [6] If sel(x) c Then check selectivity [7] insert(x, index) the gram is useful [8] Else [9] expand : expand # x [10] k : k 1 Figure 4. Construction of a multigram index Theorem 3.9 Let X be the set of grams indexed by algorithm ....

[Article contains additional citation context not shown here]

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. AddisonWesley, Reading, MA, USA, 1988. 11

....with respect to the core, assuring that all main functions (unit interactions) are tested. These abstract tests are then translated into concrete tests by filling in the blanks heuristically. The resulting test suite has the advantage of being exhaustive on the main functions. The AWK language [2] is used to write a translator. Following is sample code: Here, var sa is a parser state variable and pci wait and idle describe internal states in the FSM number 4 from Figure 5. A resulting translated test (at the transaction level) for the described system would then be for example: Fig. 5. ....

A. Aho, B. Kerningham, and P. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

....to their topologies would be a good starting place for many new tools. The building block proposed by this thesis is a method for specifying and implementing computations on netlists, especially device netlists. The specification technique can be described as a graph analog to the UNIX tool awk. [7] Just as awk searches for matches of regular expressions, and executes a code fragment wherever matches are found, this system processes netlists by specifying subcircuit topologies along with code to run whenever the corresponding subcircuits are found. 1.3. A Concrete Example A sample ....

A. Aho, "The AWK Programming Language", Addison-Wesley, 1988

....the four models defined in step 3 was carried out automatically by a small number of modellers, i.e. software components that are part of Circe s modular architecture. The logic needed to build these models, implemented as additional modules of the existing tool, was less than 100 lines of AWK [24] code. 7. Checking that the models satisfy chosen properties. The properties we selected were analysed by a number of specialized validators (also implemented as components for Circe) each consisting of a few lines of code only. Many of the chosen properties, mostly concerning obvious ....

Aho AV, Kernighan BW, Weinberger PJ. The AWK Programming Language. Addison-Wesley: Reading, MA, 1988.

....et al. are incomparable with those of Bacon et al. 3] since Bacon et al. report the exact pause times, measured by the Jalapeno JVM. 1. 8 Related work The traditional method of reference counting, was rst developed for Lisp by Collins [10] It was later used in Small talk 80 [22] the AWK [1] and Perl [39] programs. Improvements to the naive algorithm were suggested in several subsequent papers. Weizman [40] studied ameliorating the delay introduced by recursive deletion. Deutsch and Bobrow [14] eliminated the need for a write barrier on local references (in stack and registers) This ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

....pattern matching. In particular, our algorithm for NEFA construction is based in part on some of the ideas developed in [Aho90, MY60] for direct construction of DFA from regular expressions. The language design has been influenced by previous pattern matching based languages such as Lex and Awk [AWK88]. Regular languages and regular languages, together with their automata equivalents, have been used widely in formal specification and verification of concurrent systems [Kurshan94] In the related area of program analysis, OO90] develops an approach for expressing sequencing constraints as ....

A.V. Aho, B.W. Kernighan, and P.J. Weinberger, The AWK Programming Language, Addison-Wesley, Reading, MA, 1988.

....[16] presents an example of technology that can be used to create code generators for AMLs. It also gives a description of the parsing technology used in the ASPECT toolset to construct abstract parse trees. The paper describes the motivation for A , its design and its evolution. A is based on [2], a language for file processing. It retains the Awk statement language and its interpreter. It also provides a mechanism for replacing the Awk parser with an arbitrary LALR parser. It further provides a new data structure and notation for parse trees, provides a way to describe parse tree ....

A.V. Aho, B.W. Kernighan, and P.J. Weinberger, The AWK Programming Language. Reading, Mass.: Addison Wesley, 1986.

....over fa; b; cg that do not have the substring ac. CHAPTER 2. SUBMATCH ADDRESSING FOR REGEXP MATCHING 5 There are many popular programs, tools, and libraries for performing regular expression matching. Most of these programs implement some extensions to the regular expression notation, like awk [3], lex [32] and ex [47] Extensions are usually implemented in order to provide more succinct and understandable ways to represent regular languages. In fact, the relative succinctness of di erent notations for regular sets has been of considerable theoretical interest [19, 37] In the regular ....

A. V. Aho, B. W. Kernighan, and P. J. Weinberger. The AWK Programming Language. Addison-Wesley, Reading, MA, 1988.

....tool set comprising the shell, awk, and make. As far as we know, all of these are implemented using an internal representation close to the source text. Descendants of these tools are now appearing that use abstract machines again, mainly for speed but also for machine independence: Awk [1] constructs a parse tree from the source. The interpreter then traverses the parse tree, interpreting the nodes. Interior nodes correspond to an operator or control flow construct; leaves are usually pointers to data. Interpreter functions return cells that contain the computed results. Control ....

A.V. Aho, B.W. Kernighan, P.J. Weinberger, The AWK Programming Language, Addison-Wesley, Reading, MA, 1988.

....variants (fgrep, egrep, agrep, etc. that allows one to search text for strings matching a regular expression. These tools generally give little to no support to process the matched strings, they just print matching lines. Such support is available in more advanced text processing languages as AWK [2] and PERL [39] and in the LEX scanner generator [25] that allow a user to execute certain actions when a specific expression is matched. TLEX provides a pattern matching and parsing library for C that generates parse trees for the strings that match a regular expression [19] Hierarchical ....

A.V. Aho, B.W. Kernighan, and P.J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

....library automation systems, including circulation systems, table of contents (TOC) alerting, billing, and photocopy tracking, consist primarily of scripts tying together database retrievals and database updates. These scripts are written primarily in high level languages such as perl [2] AWK [3] , and Unix shell(s) The above conveys a view of our library systems as modules which have, at their lowest level, database retrievals and updates. Until recently, a software module that used a database had to reside on the same computer as the database. From the 1960s through 1990, our library ....

Aho, Alfred V., Kernighan, Brian W, and Weinberger, Peter J. The AWK Programming Language . Addison-Wesley Publishing Company, 1988.

....6. Building models. The task of building the four models defined in step 3 was carried out by a small number of modelers, i.e. plug ins of Circe s modular architecture. The logic needed to build these models, implemented as additional modules of the existing tool, was less than 100 lines of AWK [Aho et al. 1988] code. 7. Checking that the models satisfy chosen properties. The properties we selected were analyzed by a number of specialized validators (also implemented as plug ins for Circe) each only a few lines of code long. Many of the chosen properties, mostly concerning obvious completeness and ....

A. V. Aho, B. W. Kernighan and P. J. Weinberger, The AWK Programming Language, Addison-Wesley, Reading, Ma., 1988.

....consists of instructions to build a submission, some con guration options, and a set of tests. Each test includes instructions for preparing the test, executing it, and evaluating its outcome. All of these instructions need to be commands understood by the Korn shell Ksh [11] Give uses an Awk [1] script to compile the testing speci cation into a set of Ksh scripts that implement the testing engine for that particular assignment. The testing engine can be executed on a single student submission or all submissions of a class, which produces a testing report; it includes a summary of failed ....

Aho, A., B. Kernighan and P. Weinberger, \The AWK Programming Language," Addison-Wesley, 1988.

....of the ellipsoid, as a function of DeltaS 12 and DeltaOE, the excess length between the focal points and the extra tilt of the ellipsoid. Figure 7 shows the combinations of DeltaOE and DeltaS 12 which were traced and fitted. The regressions were done with Gaussfit [JFMM88] driven by an AWK [AKW88] program; the AWK program printed the results as C function srEllipsoid( which is shown in Table 3. The fitted function is a simple polynomial in two independent variables; the two variables are scaled so that ( Sigma1, Sigma1) cover the range ( Sigma100, Sigma10) in ( DeltaS 12 , DeltaOE) cf ....

....feed horn. A simple algorithm searched the columns of the grid of numbers which produced the contour map in Figure 9, and produced a list of optimum DeltaOE values as a function of DeltaS 12 . This list was then fitted with a Chebyshev polynomial, using Gaussfit [JFMM88] driven by an AWK [AKW88] program. The fitted coefficients were printed as another C function srEllipsoidBestRms( which is shown in Table 4. The RMS of fit was comparatively large, 0.4 mm; the author assumes that this was because the grid of cases which was searched was coarse. The range of DeltaS 12 which occurs in ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK programming language. Addison-Wesley, New York, 1988. QA76.73.A95A35, ISBN 0-201-7981-X.

....processing. The general purpose programming language which is currently, and probably for a while to come, the de facto standard is ANSI C and it s object oriented extension C . Unix also offers a number of languages that are particularly suited for string processing, such as sed [Dou91] and awk [AKW88]; particular mention deserves Perl [WS91] which is suitable as much for writing short, throw away programs as for complex conversion tasks. Finally, the GNU editor Emacs must be mentioned which, although as with most things Unix, has a long learning curve, does offer very powerful functionality ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The Awk Programming Language. Addison Wesley, Reading, Massachusetts, 1988.

....c 2f = 299792458000 2 1500000000 = 99:93082 mm: 1) The fact that the modulation period of the GBT range nders is 100 mm to an accuracy of about 0.1 is convenient when inspecting listings of raw data of ranges measured over reciprocal paths: the cycle ambiguities are obvious. The AWK program [AKW88] rfpcPlane4GetData.awk reformatted the range nder data and separated the target retrore ector, ZRG and WEATHER data into separate les for the two runs. 4 Page 2 D phase closure with GBT laser range nders GBT Memo 202 The les were concatenated and then Perl [WCS96] program ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK programming language. Addison-Wesley, New York, 1988. QA76.73.A95A35, ISBN 0-201-7981-X.

....McCabe s. We also implemented a measure that counts the number of decision point in a BNF rule. This is in fact a combination of McCabe and the Nesting degree. This measure gives us the highest correlation: a rule with many decision points is complex and vice versa. Using a simple awk [1] one liner we transform the data that we list with our tools into formatted reports. 4 Language Description Reengineering In the previous section we discussed many useful and simple tools that give an impression of the current state of a language description and we take care of the fact that it ....

A. Aho, B.W. Kernighan, and P.J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

.... specifications of programming languages they describe lexical tokens, and in text manipulation systems they describe textual patterns that trigger processing actions [ASU86, DO87] They have become the basis of standard utilities such as the scanner generator lex and the text tools awk and egrep [AKW88, Sta89]. Regular expressions provide an appropriate notation for regular languages in text based user interfaces, whereas finite automata are the preferred data structure for programming purposes. Two distinct methods have been devised to translate a regular expression into a nondeterministic finite ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, Reading, Massachusetts, 1988.

....AT T Bell Laboratories Murray Hill, New Jersey 07974 Abstract cql is a UNIX system tool that applies C style query expressions to flat file databases. In some respects it is yet another addition to the toolbox of programmable file filters: grep [Hume88] sh [Bour78] BK89] awk [AKW88], and perl [Wall] However, by restricting its problem domain, cql takes advantage of optimizations not available to these more general purpose tools. This paper describes the cql data description and query language, query optimizations, and provides comparisons with other tools. 1 Introduction ....

A. V. Aho, B. W. Kernighan, P. J. Weinberger, The Awk Programming Language , Addison-Wesley, 1988.

....information from a business report. For example, she may manually place data from a business report into her spreadsheet. If she receives the business report electronically, she may programmatically transfer the data to a database application such as Access [1] using specialized tools such as awk [3], perl [25] Cambio [8] InfoXtract [6, 15] or Monarch [19] The di#culties she faces in an ad hoc approach are: the manual specification, the e#ort to set up a process, the e#ort to maintain the process, and the acquisition of su#cient programming skills to modify the process. Automatic ....

A.V. Aho, B.W. Kernighan, and P.J. Weinberger. The AWK Programming Language. Addison-Wesley, Reading, Massachusetts, 1988.

....specialised case of distfix operators) He does not however address the problem of varying precedence and associativity. Thus the scheme was extended in a way described in section 2.3.1. Expression juxtaposition without an operator as used in HASKELL is also found in the awk programming language [AKW88] for indicating string concatenation. That feature is responsible for 156 shift reduce errors in the Eighth Edition [V885] nawk grammar. The authors have attempted to fix this by adding a prec keyword in the yacc specification rule for string concatenation. This method does not work for reasons ....

....environments such as Smalltalk [Gol80] InterLISP [Tei78] the I.C. Transformation Environment, QuickBASIC [MSQ88] and muProlog [Nai84] 3. Little (and not so little) specialised languages such as the UNIX text processing family of eqn [KC] tbl [Les82] troff [Oss82] and ditroff [Ker] awk [AKW88] perl [Wal88] etc. HASKELL is neither a command interpreter nor a specialised language, thus an interpretive implementation of HASKELL would fall into the second area, that of interactive programmingenvironments. The needand importance of a user friendly functional language environment is ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

....to take advantage of Rigi s ability to read a stream of tuples representing relations and objects. These tuple streams could be generated from compiler listings produced by PL AS, where information about program structure is presented in a more regular format than the source code itself. AWK [1], a wellknown UNIX file processing tool, seemed suitable, and we wrote AWK scripts to generate the required tuples from a compiler listing. For example: DATA file name data name CALL file name procedure name PROC file name procedure name STRUCT file name struct name MEMBER struct name ....

Aho, A., Kernighan, B., and Weinberger, P. The AWK Programming Language. AddisonWesley, 1988.

....by the collector. We thus expect the algorithm to demonstrate scalability in both the size of the heap and the number of mutator threads. 1. 5 Related work The traditional method of reference counting, was first developed for Lisp by Collins [7] It was later used in Smalltalk 80 [17] the AWK [1] and Perl [29] programs. Improvements to the naive algorithm were suggested in several subsequent papers. Weizman [30] studied ameliorating the delay introduced by recursive deletion. Deutsch and Bobrow [11] eliminated the need for a write barrier on local references (in stack and registers) This ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

.... specifications of programming languages they describe lexical tokens, and in text manipulation systems they describe textual patterns that trigger processing actions [2, 9] They have become the basis of standard utilities such as the scanner generator lex and the text tools awk and egrep [1, 16]. Regular expressions provide an appropriate notation for regular languages in text based user interfaces, whereas finite automata are the preferred internal data structure for programming purposes. Two distinct methods have been devised to translate a regular expression into a nondeterministic ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, Reading, Massachusetts, 1988.

....6. Building models. The task of building the four models defined in step 3 was carried out by a small number of modelers, i.e. plug ins of Circe s modular architecture. The logic needed to build these models, implemented as additional modules of the existing tool, was less than 100 lines of AWK [Aho et al. 1988] code. 7. Checking that the models satisfy chosen properties. The properties we selected were analyzed by a number of specialized validators (also implemented as plug ins for Circe) each only a few lines of code long. Many of the chosen properties, mostly concerning obvious completeness and ....

A. V. Aho, B. W. Kernighan and P. J. Weinberger, The AWK Programming Language, Addison-Wesley, Reading, Ma., 1988.

....and tool implementation is illustrated in fig. 2. 3 Three Little Languages and their Compilers In the following sections we will describe three little languages that were used for implementing parts of the Haskell system. Examples of little languages developed in the same spirit can be found in [1, 2, 3]. 3.1 Character Class Compiler A number of tools are available for supporting the generation of lexical analysers. Some of them are lex [25] flex [26] and gperf [28] The lexical analysis of the Haskell source is a non trivial problem. Although the initial implementation of the Haskell scanner ....

Aho AV, Kernighan BW, Weinberger PJ (1988) The AWK Programming Language. Addison-Wesley.

....science courses and can be put to good use when building a system in this way. Therefore, the implementation of a specially built, lightweight language can be a valid, realistic, and costeffective proposition. Many simple interpreters can be implemented using text processing tools such as awk [AKW88] and Perl [WS90] This implementation avenue can be particularly effective if the language has been designed by following the guidelines outlined in the following four paragraphs. Interpreters and compilers for more complicated languages can always be modeled using the lex yacc [JL87] model; often ....

....The problem of choosing an application s implementation language forms part of language design research [Wir74, Wex76, Hoa83] In this section we examine some representative specialized languages that justify our approach. The implementation of a number of specialized languages can be found in [AKW88] and [Ben88, pp. 83 100] A data driven approach to structure programs is recommended in [KP78, p. 67] let the data structure the program. An example of a language with a narrow, specialized application domain is the one described in [CP85] Specialized languages and tools for compiler ....

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

....the substitution of variables defined in actions on the RHS of productions. Actions are widely used in this manner to generate labels, compute branch targets, and perform assignment of values to unique local variables. The code in action blocks, like the entire lava system, is written in AWK [Aho et al. 88] In addition to these attributes, each production carries a weight that determines which productions fire in case more than one are eligible for a given LHS. This case occurs frequently in code production, as it is quite often possible to insert just about any instruction sequence at any point ....

Aho, A.V., Kernighan, B.W., Weinberger P. J. The Awk Programming Language. AddisonWesley, June 1988.

....there are only few reduction steps in a proof. The following table shows the results of first experiments with well known benchmark examples. We have used a simple prototype version of DELTA and SETHEO V3.1 as the top down prover. This prototype has been implemented in UNIX shell, using awk [AKW88] scripts for manipulating the formula and filtering the unit clauses. As a resource bound for the preprocessing and the final top down search, the depth of the proof tree (A literal depth) has been used. DELTA has always been started with default parameters, except in cases where the number of ....

A. Aho, B. Kernighan, and P. Weinberger. The AWK Programming Language. Eddison Wesley, 19988.

....together for one purpose or another. This one line sed command makes noweb treat two chunk names as identical if they differ only in their representation of whitespace: sed e use s [ t] t] g e defn s [ t] t] g This little filter, a Bourne shell script written in awk (Aho, Kernighan, and Weinberger 1988), makes the definition of an empty chunk ( stand for a continuation of the previous chunk definition. awk BEGIN lastdefn = defn defn print lastdefn; next defn lastdefn = 0 print To share programs with colleagues who don t enjoy literate programming, ....

Aho, A. V., B. W. Kernighan, and P. J. Weinberger (1988). The AWK Programming Language. Reading, MA: Addison-Wesley.

....information. The recognition algorithm in its simplest form consists in matching the surface of the unknown word form with the corresponding key of a lemma in the on line lexicon, thus providing access to the relevant lexical description. 5 For this, special programming languages like AWK (Aho, Kerningham Weinberger 1988) and PERL (Wall Schwartz 1990) are available. 5 3.5 MATCHING A SURFACE ONTO A KEY word form surface: wolf matching lemma: wolf (lexical description) There exist several computational methods to match a given surface automatically with the proper lemma in an electronic lexicon. 6 The ....

Aho, A.V., B.W. Kerninghan, & P. Weinberger (1988) The AWK Programming Language, Addison-Wesley Publishing Company, Reading, Massachusetts.

....1993 1993 by John Wiley Sons, Ltd. Revised 1 December 1993 1998 by University of Nottingham. 386 DENNIS S. ARNON manual represented in the WordPerfect tool to an instance of the J2008 SGML DTD for auto repair manuals. There has been much success of string regular expressions, Unix grep, awk [14], and perl [15] in this domain. Indeed, specialized extensions of these tools such as XGML Omnimark [16]andFastTAG[17] are available. Scrimshaw is intended to provide a tree to tree extension of these tools. Formulating document queries is clearly a manual activity only the user knows what he ....

A.V. Aho, R. Kernighan, and P. Weinberger, The AWK Programming Language, Addison-- Wesley, Reading, MA, 1988.

No context found.

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

No context found.

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

....convention is to use fonts like monospace and italic for keywords, variables, program names, and the like. When such terms are to appear in indices, special care must be taken to have them sorted properly. The sheer number of such terms also mandates a concise input. The index to Reference[3] has 1015 index terms, of which 460 involve a font change. Bare formatting requests are too bulky in troff and not much better in T E X. Accordingly the language provides two abbreviations for font changes: a part of a term enclosed in [ is printed in monospace and a part enclosed in is ....

....roman num.collapse put many number pairs onto one line rotate make rotated copies of each line gen.key generate a sort key, if one wasn t provided final.sort sort using the key format do font and size changes, etc. The awk programs rely on features in the awk interpreter released in mid 1985[3]. The pipeline actually uses temporary files to connect the stages (since some systems have a small limit on the number of programs in a pipeline and the intermediate files are also useful for debugging) and deletes the files at the end. BELLS AND WHISTLES Our programs produce a basic index. ....

[Article contains additional citation context not shown here]

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger, The AWK Programming Language, Addison-Wesley, 1988.

No context found.

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

No context found.

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

No context found.

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger. The AWK Programming Language. Addison-Wesley, 1988.

No context found.

A. Aho, B. W. Kernighan, and P. J. Weinberger, The AWK Programming Language, Addison-Wesley, Reading, Mass., 1988.

No context found.

Aho, A. V. The AWK programming language, Addison-Wesley Pub. Co., 1988.

No context found.

A. V. Aho, B. W. Kernighan, and P. J. Weinberger. The AWK Programming Language. Addison Wesley, 1988.

No context found.

A. V. Aho, B. W. Kerningham, and P. J. Weinberger. The AWK Programming Language. Addison-Wesley, Reading, Ma., 1988.

No context found.

A. V. Aho, B. W. Kerninghan, and P. J. Weinberger; The AWK pro- gramming language; Addison-Wesley, 1988.

No context found.

A. V. Aho, B. W. Kernighan, and P. J. Weinberger. The awk Programming Language. Addison-Wesley, Reading, MA, USA, 1988.

No context found.

Alfred V. Aho, Brian W. Kernighan, and Peter J. Weinberger, The AWK Programming Language, AddisonWesley, Reading, MA, 1988.

First 50 documents  Next 50

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