Chomsky and CFL

Context-free languages are also called [...] in the Chomsky Hierarchy.

• Type-0

• Type-1

• Type-2

• Type-3

Regular languages are [...] than context-free languages.

• more expressive

• less expressive

When it comes to natural languages, CFG can be used for...

• syntax parsing.

• tokenising.

• recognising e-mail addresses.

• semantic parsing.

What is one of the big advantages of context-free languages over regular ones?

• they are computationally less expensive

• their corresponding automata are simpler than FSA

• they can 'remember' how often a symbol occurs and make sure another symbol occurs equally as often

• they are less complicated to describe.

Regular languages are to FSA as context-free languages are to...