Shiksha Nation
Skip to content

Unrestricted grammar

Type of formal grammar

  • 3 min read
  • 3 chapters

Related on Lably

Through Turing machine

Formal definition

An unrestricted grammar is a formal grammar G=(N,T,P,S), where

  • S∈N is a specially designated start symbol.

As the name implies, there are no real restrictions on the types of production rules that unrestricted grammars can have.

Sign up free to read the rest

2 more chapters are free with a Lably account.

Already have an account?

More in Language and linguistics