Is Python 3.5 an LL (1) grammar?

Question

I saw http://matt.might.net/teaching/compilers/spring-2015/ saying that Python 3.4 is LL (1)

Is Python 3.5 grammar still LL (1), so can I write a recursive descent parser?

Answer 1

Yes. This is a deliberate language function, not just what happened. PEP 3099 explicitly rejected any changes to this for the Python 2 → 3 transition (a noticeably larger transition than any 3.x → 3.y would be):

• The parser will not be more complex than LL (1).

  , . . Python LL (1) - , . , , , , Perl.