The current implementation SysEx parsing relies heavily on binary matching. However, that is far from ideal, as it doesn't allow branch breaking, resulting in spaghetti code at times to handle edge cases, not to mention potentially wasting comparison times.
The new tree matching resembles that exist in m17n, with or without explicit support on states.
The current implementation SysEx parsing relies heavily on binary matching. However, that is far from ideal, as it doesn't allow branch breaking, resulting in spaghetti code at times to handle edge cases, not to mention potentially wasting comparison times.
The new tree matching resembles that exist in
m17n, with or without explicit support on states.