/* By: ljiriste <ljiriste@student.42prague.com> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2024/05/27 21:21:54 by ljiriste #+# #+# */
-/* Updated: 2024/06/21 15:39:41 by ljiriste ### ########.fr */
+/* Updated: 2024/06/21 15:48:59 by ljiriste ### ########.fr */
/* */
/* ************************************************************************** */
// State token[i] token[i+n]
// j states[j].lookahead[i] states[0].goto[i]
//
-// The first row contains all the n terminal tokens first
-// and after them all the non-terminal tokens.
+// The first row contains all the n terminal tokens first followed by
+// $ (the end token) 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.
//