Execute a Markov algorithm: Difference between revisions

Execute a Markov algorithm (view source)

Revision as of 10:19, 18 December 2009

81 bytes removed , 14 years ago

Removed mention of "stretch" goals; they're just input datasets that ensure correct implementation of the rules.

Anonymous user

rosettacode>Dkf

Revision as of 00:12, 18 December 2009 (view source) Underscore (talk \| contribs) m (→‎{{header\|Haskell}}: "putStrLn" -> "putStr") ← Older edit		Revision as of 10:19, 18 December 2009 (view source) rosettacode>Dkf (Removed mention of "stretch" goals; they're just input datasets that ensure correct implementation of the rules.) Newer edit →
Line 45: '''Ruleset 3:'''<br> ~~A stretch goal.~~ This tests for correct substitution order and may trap simple regexp based replacement routines if special regexp characters are not escaped. <pre># BNF Syntax testing rules A -> apple Line 63: '''Ruleset 4:'''<br> ~~A stretch goal.~~ This tests for correct order of scanning of rules, and may trap replacement routines that scan in the wrong order. It implements a general unary multiplication engine. (Note that the input expression must be placed within underscores in this implementation.) <pre> ### Unary Multiplication Engine, for testing Markov Algorithm implementations Line 503: I bought a bag of apples from my brother. </lang> '''Discussion''': The J implementation correctly processes all the rulesets~~, including the stretch goals~~. More details are available on the [[Talk:Markov Algorithm#explicit_vs_tacit\|the talk page]]. =={{header\|Perl}}== Line 633: assert replace(text1, extractreplacements(grammar2)) \ == 'I bought a bag of apples from T shop.' ~~# Stretch goals~~ assert replace(text2, extractreplacements(grammar3)) \ == 'I bought a bag of apples with my money from T shop.'