Grammer for regular expressions

Details Grammer for regular expressions Grammer for regular expressions

2006-08-15

2006-08-15

Dam, Tuan (Department: 2192)

Data processing: software development, installation, and managem

Software program development tool

Programming language

C707S793000

Reexamination Certificate

active

07093231

ABSTRACT:
The grammar of this invention is an approach to regular expressions which introduces advantages to programmers who use regular expressions for scanning, searching, and tokenizing text:Allowing composition of regular expressions (patterns) through the standard C/C++ operators (using C/C++ precedence and associativity), thus appealing to a huge audience of programmers already familiar with that style of grammar.Generalizing the negated character-class (so familiar to Perl programmers) in a way that quite dramatically allows ANY pattern composition to be used for searching (the “subjunctive” binary composition).Integrating into an elegantly simple grammar form (“do-pattern”) the ability to create arbitrary side-effects of tokenization, accomplished in prior art through a cumbersome combination of tokenizing expressions and parse trees, such as in the grammar style of Lex-Yacc.Generalizing the capture-to-variable feature (as seen in Perl), allowing the capture of portions of the stream (match sub-expressions) into any variable current in the scope of the regular-expression.Allowing the parameterization of production rules, as templates, which allow similar (in form) regular expressions to be written as multiple instantiations of the same production rule template (accomplished via in params).Further allowing parameterization of production rule templates to extend to the capture output of the expressions (accomplished via a combination of “do-patterns”, “capture-patterns”, and out or in/out params).Creating novel support algorithms (to accomplish the above) not seen in any texts on finite automata.

REFERENCES:
patent: 5946490 (1999-08-01), Lieberherr et al.
patent: 6425119 (2002-07-01), Jones et al.
patent: 6748585 (2004-06-01), Proebsting et al.
patent: 2002/0138819 (2002-09-01), Hills
patent: 2003/0145308 (2003-07-01), Geisinger
Jeffrey Friedl, Mastering Regular Expressions, Jul. 2002, O'Reilly, 2nd Edition, pp. 1-56.
Noord, et al., An Extendible Regular Expression Compiler for Finite-state Approaches in Natural Language Processing, 1999, Workshop on Implementing Automata; WIA99 Pre-Proceedings, Potsdam Germany, pp. 1-18.

Affiliated with

Also associated with

Rating

Grammer for regular expressions does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Grammer for regular expressions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Grammer for regular expressions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3614625