What's more curious than the irreducability issue is, how on earth does the syntax ever get accepted by the parser? I mean the lex/yacc syntax has to reflect the nestability of the while/switch [1], ditto if you do…
What's more curious than the irreducability issue is, how on earth does the syntax ever get accepted by the parser? I mean the lex/yacc syntax has to reflect the nestability of the while/switch [1], ditto if you do…