Anonymous user
Talk:Execute a Markov algorithm: Difference between revisions
m
→explicit vs tacit
m (→explicit vs tacit: tacit markovLexer & replace) |
|||
Line 78:
ruleNo =. 0 {:: ]
markovLexer =. (,. ] (}.&.>~ ,. ]) ('.'={.)&.>)/@:|:@:lexed@:normal@:lines
lines =. LF cut
normal =. a: -.~ (dltb
lexed =. 0 _1 {"1 '\s+->\s+' (
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).
| |||