Markov algorithm: Difference between revisions

Revision as of 00:20, 11 June 2010

Revision as of 14:03, 1 September 2010

Line 11:

#Check the Rules in order from top to bottom to see whether any of the ''patterns'' can be found in the ''input'' string.

#If none is found, the algorithm stops.

#If one (or more) is found, use '''the first''' of them to replace the leftmost matching text in the ''input'' string with its ''replacement'' in the first applicable rule.

#If the applied rule was a terminating one, the algorithm stops.

#Return to step 1 and carry on.