Soros language specification1 DRAFT, [removed]László Németh ([removed]) 1 Introduction The Soros programming language is a regex based language for conversion between self-similar

First Page		Document Content
Date: 2010-04-19 08:50:28 Source code Regular expressions Formal languages Automata theory Pattern matching Subroutine Computer programming Software engineering Computing		Soros language specification1 DRAFT, [removed]László Németh ([removed]) 1 Introduction The Soros programming language is a regex based language for conversion between self-similar Add to Reading List Source URL: www.numbertext.org Download Document from Source Website File Size: 109,62 KB Share Document on Facebook

	Unfailing Haskell: A Static Checker for Pattern Matching Neil Mitchell and Colin Runciman http://www.cs.york.ac.uk/∼ndm , http://www.cs.york.ac.uk/∼colin University of York, UK DocID: 1xVgx - View Document
	SWiM: Secure Wildcard Pattern Matching From OT Extension Vladimir Kolesnikov1? , Mike Rosulek2 , and Ni Trieu2 1 2 DocID: 1vgge - View Document
	Regulatory sequence analysis Matrix-based pattern matching Jacques van Helden Aix-Marseille Université, France DocID: 1v6Pd - View Document
	LPEG: a new approach to pattern matching Roberto Ierusalimschy PEG: Parsing Expression Grammars DocID: 1utvV - View Document
	Analysis of Fundamental Exact and Inexact Pattern Matching Algorithms Jonathan Lee ID# DocID: 1uq9c - View Document