It should be possible to rewrite a non-recursive CFG [1] as an acyclic NFA, since non-recursive CFGs represent finite languages (and thus regular a fortiori). Is there an explicit algorithm to rewrite an ε-free non-recursive grammar into an equivalent ε-free NFA? My instinct is to put the grammar...

I have two implementations of the crc calculation. The crc_classic is based on the typical implementation you can find for example on Wikipedia The second one might be found in D.3.2 here IO-Link I'm looking for an explanation why the second one does the same as the first one. The second one is t...