The parsers generated from futhark/parser.fut and src/Alpacc/Generator/Parser.hs currently uses pattern matching for LLP tables.
As far as I understand, futhark compiles these to if statements so it would be much better if they were static hash tables.
Static hash tables could also be used for the associative table in futhark/lexer.fut and src/Alpacc/Generator/Lexer.hs since it is probably a very sparse table since most combinations would result in a dead endofunction/endomorphism.
The parsers generated from
futhark/parser.fut
andsrc/Alpacc/Generator/Parser.hs
currently uses pattern matching for LLP tables. As far as I understand, futhark compiles these to if statements so it would be much better if they were static hash tables. Static hash tables could also be used for the associative table infuthark/lexer.fut
andsrc/Alpacc/Generator/Lexer.hs
since it is probably a very sparse table since most combinations would result in a dead endofunction/endomorphism.