İptal Edildi

Regullar Expressions in Haskell

I need a implementation of a mechanism to identify the strings based on some regular expressions.

The elements that can appear in regular expressions are:

Small letters: a, b etc.

Sequence: ab, aabbb etc.

Parentheses for grouping.

? operator, Example: "ab?c" determine "abc", and with "ac".

"(ab)?c" determine "abc", and with "c".

* operator. Example:

"ab*c" determine "ac", "abc", "abbc" etc.

"(ab)*c" determine "c", "abc", "ababc" etc.

+ Operator. Example:

"ab+c" determine "abc", "abbc" etc., but not "ac".

"(ab)+c" determine "abc", "ababc" etc.,but not "c".

| Operator. Example:

"ab|c"determine"ab" and with "c".

"a(b|c)" determine "ab" and with "ac".

This project must use the parser given in the attachament.

I need this project done until 29 April 2013.

Beceriler: Haskell

Daha fazlasını görün: use regular expressions, regular expressions in c, regular expressions example, regular expressions c, example regular expressions, c regular expressions, c 11 regular expressions, abc 11, expressions, project haskell, haskell project, Regular Expressions, programming longest common sequence, cursive letters, fundraising project letters, want sell letters, longest common sequence visual basicnet, letters tracing elegant, flash animated intro sequence, free sample letters sponsorship, proofreading business letters, play flash sequence

İşveren Hakkında:
( 0 değerlendirme ) Bucharest, Romania

Proje NO: #4456390

1 freelancer is bidding on average $90 for this job


Hello, i can help you. Please contact [url removed, login to view]

in 5 gün içinde90$ USD
(1 Değerlendirme)