I am new to nom, and trying to fix [this code](https://github.com/marcelbuesing/can-dbc/blob/4e3c9f40016330a894793338dfbc4d8c7811b005/src/parser.rs#L1628) which would require 22 permutations. Is there a recommended way to handle more than 21 mandatory cases?
