pattern matching in assembly using unix

This program is to be done in assembly on a beginners level. In other words no advance assembly functions and complex algorithms. THIS IS SUPPOSE TO BE EASY. You are required to write a MAL program to determine weather or not a specified pattern occurs in a given text string. ## Deliverables 1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased. 4)comments must be inserted for each operand,variable,algorithm. 5)must cover every possible pattern for a text sentence 6)must be done on one file AND You are required to write a MAL program to determine weather or not a specified pattern occurs in a given text string. Important note: Throughout this description, quotes are used around patterns and text strings. The quotes themselves are not part of the pattern or the text string. Each valid text string contains only upper or lowercase letters, spaces (blanks) or digits. Each valid text string has at least one character and at most 80 characters. Each valid pattern contains upper or lower case letters, blanks, digits or the special characters '[',']','?','^','$'. Each valid pattern has at least one character and at most 30 characters. a) The pattern character '?' matches any single character in the text string at that position. Example, the pattern "g?me" occurs in the text string "Assignment IV". The pattern "?Gra??f" occurs in the text string "The Grateful Dead". The first '?' matches the space before the 'G'. b)The pair of characters '[' and ']' is used to specify a set of characters. There is a match at certain position of the text if the text contains any of the characters in the set in that position. Example, the pattern "Ass[er][dm]" occurs in the text "Assembly" As well as "Assed". In a valid pattern, the set of characters enclosed by '[' and ']' will satisfy all of these 3 conditions (i)The set will contain only upper case or lower case letters and digits.(ii)There will be at least one char in the set. (iii)No char in the set will be repeated. c)The pattern character '^' may occur only as the first character in a valid pattern. This special character indicates that the specified pattern occurs in the text string only if there is a match beginning with the first character of the text string. Example, the pattern "^m?re" occurs in the text string "more or less", but not in "One more time". d)The pattern character '$' may occur only as the last character in a valid pattern. This special character indicates that the specified pattern occurs in the text string only if there is a match ending with the last character of the string. Example, the pattern "l??e$" occurs in the text string "One life to live", but not in "A lame excuse" or "One life to Live", notice the capitalized L. The program should prompt the user for a text string. The user will type in the text string and indicate the end of the text string by the new line('\n') character. (Note that the new line character is not part of the text string). If the text string is invalid, the program should print an error message and ask the user for a text. After obtaining the a valid text string from the user, the program should prompt the user for a pattern. Again, the user will type in the pattern string and indicate the end of the pattern string by the new line. the new line character will not be part of the pattern. If the pattern is invalid, the program should print an error message and ask the user for another pattern. After obtaining a valid text string and a valid pattern, the program should determine whether the pattern occurs in the string, print "result: yes" or "result: no" and stop. ## Platform I will be using Unix and SPIM to compile it. The program must be able to work on unix using spim to complie it.