<--- Back to Details
First PageDocument Content
Pattern matching / Regular expressions / Procedural programming languages / Data types / Type theory / Subtype polymorphism / TRE / ALGOL 68 / Luca Cardelli / Software engineering / Computing / Computer programming
Date: 2013-12-06 16:18:32
Pattern matching
Regular expressions
Procedural programming languages
Data types
Type theory
Subtype polymorphism
TRE
ALGOL 68
Luca Cardelli
Software engineering
Computing
Computer programming

Greedy regular expression matching Alain Frisch INRIA Luca Cardelli MSRC

Add to Reading List

Source URL: www.cduce.org

Download Document from Source Website

File Size: 416,91 KB

Share Document on Facebook

Similar Documents

Polynomial Functors Constrained by Regular Expressions A A

DocID: 1uKlC - View Document

Regular Expressions for URL Targeting Regular expressions are used widely in computer programming, allowing people to search through many lines of code for a specific piece of data or find a 

DocID: 1uIrT - View Document

Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org SUCCINCTNESS OF THE COMPLEMENT AND INTERSECTION OF REGULAR EXPRESSIONS WOUTER GELADE AND FRANK NEVEN

DocID: 1ukTL - View Document

Tao of Regular Expressions Tao of Regular Expressions Revised: June 5, 1999 by Steve Mansour, Regular expressions explained in three levels: easy, medium, and difficult. Numerous examples. CONTENTS

DocID: 1uhmU - View Document

Regular Expressions Considered Harmful in Client-Side XSS Filters Daniel Bates Adam Barth

DocID: 1tYDb - View Document