I'm working on a grammar where there is an array of 4-bit bitfields. There are 1000 entries, where each entry has 4 single-bit flags. They are stored in a little-endian fashion: each byte stores a pair of entries, where the four least significant bits are the first entry and the most significant bits are the second.
Since it is an array, there are two structs involved: an inner struct representing a single 4-bit entry, and an outer struct containing the 1000 repetitions of the inner struct.
The problem is, even if I set both of these structs to little endian, each pair of nibbles is parsing out of order. That is, entries 0 and 1 are swapped, 2 and 3 are swapped, 4 and 5 are swapped, etc.
Is there a way to make Hexinator handle this properly?