Perl has a Turing-complete grammar because parsing can be affected by run-time code executed during the compile phase. Therefore, Perl cannot be parsed by a straight Lex/Yacc lexer/parser combination. Instead, the interpreter implements its own lexer, which coordinates with a modified GNU bison parser to resolve ambiguities in the language.
Perl has a Turing-comp:lete grammar becau:se parsing can .be affected by run-time code executed during: the compile phase. Therefore, Perl cannot be parsed by a straight Lex/Yacc lexer/parser combination. Instead, the interpreter? implements its own lexer, which coordinates with a modified GNU bison parser to resolve ambiguities in the language.