True or False and why? $($See image$)$

Regular expressions cannot match arbitrarily sized strings that are palindromes

Parsers care about if a sentence is grammatically correct

'self' in Python is used to refer to the particular instance of the class

Push Down Automata can recognize regular languages

Turing Machines are capable of solving any solveable problem

Finite State machines have no external memory like a stack

Grammars do not tell you about semantics, just syntax

Lists can be thought of as either empty, or an item that points to a list

The regular expression $"[$a$-$c$]"$ is equivalent to the regular expression $"$ a$|$b$|$c $"$

Syntax includes grammar and semantics includes syntax