<snip> at this point it may require too much refactoring to get it done.
I haven't looked at the FPC code that implements variable declaration parsing but, based on its behavior I have a guess that has a reasonable chance of being right, which is:
When parsing a single variable declaration, the parser can go linearly from variable name token, colon token, type token, equal token, value token. Fully linear, very simple. Quite likely there is a production to do just that.
For a variable group, it probably uses a recursive algorithm. On every comma, it recurses, when it finds the colon, it stops recursing and the current token should be the data type (reached when the colon was consumed.) At that point, it most likely starts unwinding the recursive calls and assigning the type it found and validated to all the variables it's holding in the recursive stack. That's fairly simple and, it really doesn't add any significant amount of complexity to parse two more tokens (the equal and the value) and validate the value but, I suspect that the algorithm used to parse the variable group is used for something else too and, that is where the addition might cause problems, it may not be meaningful in that context.
Anyway... guess and speculation. Bottom line: it's useless.