— That way I don't have to worry about "\n" being parsed weird, among others
Floofies ... Bro... Would be a pleasure if I could actually understand how that parser works... I am sire it would help me knowledge wise ... A lot... Maybe even join you
— Well that particular one is a very basic LR(1) parser. LR means "Left-to-right Rightmost-derivation", and the 1 indicates it has 1 symbol of lookahead.
— It will add symbols to the stack before knowing what to do with them, and usually makes the decision of what to do with them when the lookahead symbol indicates it. As soon as the lookahead symbol has a reduction entry in the parse table (or in this case, a plain conditional) it then does something with some or all of the symbols in the stack, immediately to the left of the lookahead symbol. It can prune the stack as a result as well
— Google "shift reduce parser", "terminal and nonterminal symbols" and "LR parser" for more info
— This is actually very understandable
— Heh, I've been studying it for a week, so I hope so
— Hello, any microservice guide for a general teaching session?
— Node microservice architecture
— Floofies How do you like Ramda?