/* By: ljiriste <ljiriste@student.42prague.com> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/05/27 21:21:54 by ljiriste #+# #+# */
-/* Updated: 2024/06/16 08:17:25 by ljiriste ### ########.fr */
+/* Updated: 2024/06/20 10:44:37 by ljiriste ### ########.fr */
/* */
/* ************************************************************************** */
// State token[i] token[i+n]
// j states[j].lookahead[i] states[0].goto[i]
//
-// The whitespace is not significant and ; should be used as separator.
-// For ease of parsing the "end of input" token $ should be the last
-// lookahead token. Additionally the states should be consecutive
-// increasing integers starting at 0.
-//
// The first row contains all the n terminal tokens first
// and after them all the non-terminal tokens.
// Every other row contains the (unique) state number and the reduce/shift
// rule for the appropriate token.
//
+// The whitespace is not significant and ; should be used as separator.
+// For ease of parsing the "end of input" token $ should be the last
+// lookahead token. Additionally the states should be consecutive
+// increasing integers starting at 0.
+// Do not use non-ASCII whitespace!
+//
// The rules table should have the form
//
// token[i_1] -> [ token[j_1] [ token[k_1] ... ]]