Talk:Execute a Markov algorithm: Difference between revisions

Content added Content deleted
m (→‎explicit vs tacit: tacit markovLexer & replace)
Line 78: Line 78:
ruleNo =. 0 {:: ]
ruleNo =. 0 {:: ]
markovLexer =. (,. ] (}.&.>~ ,. ]) ('.'={.)&.>)/@:|:@:lexed@:normal@:lines
markovLexer =. (,. ] (}.&.>~ ,. ]) ('.'={.)&.>)/@:|:@:lexed@:normal@:lines
lines =. LF cut h TAB&=`(,:&' ')}
lines =. LF cut TAB&=`(,:&' ')}
normal =. a: -.~ (dltb h@:{.~ i:&'#')&.>
normal =. a: -.~ (dltb@:{.~ i:&'#')&.>
lexed =. 0 _1 {"1 '\s+->\s+' ( rxmatch h rxcut h ])S:0 ]</lang>
lexed =. 0 _1 {"1 '\s+->\s+' (rxmatch rxcut ])S:0 ]</lang>


But I do not think that the tacit can claim any advantage over the explicit, in this case. Unless someone can come up with a clearer way of expressing the algorithm tacitly (maying using a different approach).
But I do not think that the tacit can claim any advantage over the explicit, in this case. Unless someone can come up with a clearer way of expressing the algorithm tacitly (maying using a different approach).
Retrieved from "https://rosettacode.org/wiki/Talk:Execute_a_Markov_algorithm"