3 ms·
A cartesian multiplication is not necessarily more readable, if it takes exponentially more code. A bit more verbosity over [QKG]add?... could be nice. For exa
by Peaker 16y ago
A cartesian multiplication is not necessarily more readable, if it takes exponentially more code.
A bit more verbosity over [QKG]add?... could be nice. For example, Haskell's parsec looks like:
do
oneOf "QKG"
string "ad"
optional (char 'd')
..
This also has the nice benefit of generating nice errors when it fails ("Expected 'ad', found ...").