linkedin facebook twitter rss

26 Mar regular

A grammar formalism characterized by its deterministic description of how things work. A regular grammar is the most restrictive and least flexible formalism.
Keywords: grammar
context-free
context-sensitive
References: algorithms
automata
computing
formalisms
logic
rules

Leave a Reply

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.