Jeffrey E. F. Friedl. Mastering Regular Expressions. O'Reilley & Associates, Cambridge, MA, 1997 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computational Models of the Genetic Code Evolution Based on.. - Weberndorfer (Correct)
....region ( 3,7 . 2 ) 3 ) 3,7 # codon loop . 2,7 # variable region ( 3,6 . 3,6 # third stem loop . # ) 5,9 # closing loop . # trailing base pairs Table 4. 1: Regular expression to match tRNAs This expression set is shown in the perl flavor of regular expressions [57] since it is taken from the GCE package (see 4.7) The secondary structure shown in figure 4.5 of yeast tRNA would exactly match the above condition. This secondary structure has been used for inverse folding of tRNA templates that were as start condition in the simulations. ....
J. Friedl. Mastering Regular Expressions. O'Reilly and Associates,, 1997.
Portable High Performance Programming via Architecture-Cognizant.. - Gatlin (2000) (1 citation) (Correct)
....actual expressions use the POSIX regular expression syntax. Some basic elements of this syntax are: Kleenestar #) and #( Parenthesis (for grouping) ##= Union Concatenation is indicated by the juxtaposition of regular expressions. For a more thorough treatment of regular expressions see [21]. We give an example here: regexp: aa (b c d ) c d ) Some legal strings that can be generated from this regular expression include aabbdbcc and adbcbbcd. 121 # ISOLATORS isolators: number [character ] number As discussed in Section 4.1 some variants can act as isolators and this ....
J. Friedl and A. Oram. Mastering Regular Expressions. O'Reilly & Associates, January 1997.
The Network Desktop Of The Purdue University Network Computing .. - Kapadia, Fortes (1999) (Correct)
....from the sample T Suprem3 input file shown in Figure 5.9. The programmable parser uses Perl s regular expression engine for string matching; the state machine associated with the regular expression engine and the syntax for the regular expressions are described in the Perl5 documentation and in [18, 31]. The following explanation assumes a basic familiarity with Perl5 regular expressions. The first two statements in the AnalysisGrammar section in Figure 5.8 are special cases they provide the programmable parser with the grammar needed to parse files that contain comments and have statements ....
Jeffrey E. F. Friedl. Mastering Regular Expressions. O'Reilly & Associates, 1997.
Design And Implementation Of Resource Access Decision Server - Espinal, al. (2000) (Correct)
....syntax as defined in [1] For example, the regular expression (resource name pattern) a would match all strings (resource names) that begin with the character a . For more information on resource name patterns, please see [20] and for regular expression syntax and usage, please see [1][10]. 4.4. Dynamic Attribute Service DynamicAttributeService (DAS) is represented by the interface of the same name. Unlike the previous components, the DAS does not have an administrative interface [20] However, the RAD server prototype introduces a DAS administrative interface, ....
Jeffrey E.F. Friedl. Mastering Regular Expressions. O'Reilly, Cambridge, MA, 1997.
Extraction and Integration of Data from Semi-structured.. - Bonnet, Bressan (1997) (5 citations) (Correct)
....from the point of view of its implementation with Prolog DCG. 3. 2 Back to the Basics A formal language [HU69] L is a set of words, i.e. sequences of letters or tokens, from an alpha 3 A practical survey of regular expression pattern matching in standard tools and languages can be found in [Fri97] 4 SNOBOL was the first language to provide regular expression pattern macthing and backtracking [GPI71] bet A (the empty sequence is noted ffl) A language described in extension, by the enumeration of its elements, is of little practical use. Instead, languages can be described by ....
J. Friedl. Mastering Regular Expressions. O'Reilly and Associates, Inc., 1997.
Writing a Tcl Extension in only 7 years - Libes (1997) (1 citation) (Correct)
....you can have rules specifically for pattern formation, making patterns easier to write and more readable once written. The corresponding disadvantage is that additional rules themselves can be a burden on the bulk of users who cannot afford the time or brainpower to master the large number of them [Friedl]. It is worth considering the analogy to expressions. In early releases, Tcl s expr command did not support the traditional functional notation that it does today. For example, sin( x) had to be written [sin x] The current expr command is much more like a traditional language, but at the same ....
Friedl, Jeffrey E.F., "Mastering Regular Expressions", O'Reilly and Associates, January 1997.
Transducers from Rewrite Rules with Backreferences - Gerdemann, van Noord (1999) (6 citations) (Correct)
....of [5] bracketing transducers for finite state parsing [8] and the LocalExtension operation of [13] The explicit use of backreferencing leads to more elegant and general solutions. Backreferencing is widely used in editors, scripting languages and other tools employing regular expressions [3]. For example, Emacs uses the special brackets ( and ) to capture strings along with the notation n to recall the nth such string. The expression (a )b 1 matches strings of the form a n ba n . Unrestricted use of backreferencing thus can introduce non regular languages. For NLP finite ....
....are closed under concatenation, handling multiple backreferences reduces to the problem of handling a single backreference: x ) T 1 Delta T 2 Delta : Delta Tn ) x) ae (4) A problem arises if we want capturing to follow the POSIX standard requiring a longestcapture strategy. Friedl [3] (p. 117) for example, discusses matching the regular expression (tojtop) ojpolo) gicaljo logical) against the word: topological. The desired result is that (once an overall match is established) the first set of parentheses should capture the longest string possible (top) the second set ....
[Article contains additional citation context not shown here]
Jeffrey Friedl. Mastering Regular Expressions. O'Reilly & Associates, Inc., 1997.
Security for Distributed Web-Applications via.. - Kuntze, Rauch, Schmidt (2005) (Correct)
No context found.
Jeffrey E. F. Friedl. Mastering Regular Expressions. O'Reilley & Associates, Cambridge, MA, 1997
Theory and Algorithms for Information Extraction and - Classification In Textual (Correct)
No context found.
E.F. Friedl, "Mastering regular expressions", O'Reilly & Associates, Inc., Sebastopol, CA, 1997.
A Multithreaded Java Framework for Information Extraction - In The Context (Correct)
No context found.
Friedl, J.E.F. (2002): Mastering Regular Expressions, 2nd edition, O'Reilly & Associates
Prolog For Topic Map Constraints - Santosaputri (2003) (Correct)
No context found.
J. Friedl. Mastering Regular Expressions, PerlRe Tutorial for Perl 5.6.1 Documentation http://www.perldoc.com/perl5.6.1/pod/perlre.html Last Access 29/03/2003
Using Perl to Create Web-based Software Tools for Wind Tunnel.. - Jenkins (2001) (Correct)
No context found.
Friedl, J., Mastering Regular Expressions. O'Reilly & Associates, 1997.
A Distributed Annotation System - Dowell (2001) (5 citations) (Correct)
No context found.
J.E.F. Friedl. Mastering Regular Expressions. O'Reilly and Associates, 1997.
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