For each description, select the term that is best defined by it$.$

Group of answer choices

A set of symbols that are used to construct strings from a language

alphabet

Using a grammar to build correct strings from a language

parser

Class of grammars that are used to recognize tokens from a programming language or to search for simple strings in test

regular grammar

A string of symbols that forms a correct sentence from a language

syntax

A part of language design that deal with how symbols are put together to form correct programs.

syntax

Programming language where all constructs are functions with no variables or sequential elements.

functional language

A standard meta$-$language for describing grammars commonly used to document languages.

Backus Nur Form $($BNF$)$

First phase of a compiler that uses regular expressions to recognize tokens and drive the parser.

scanner

Formal definition of a grammar including alphabets for terminals and non$-$terminals, production rules, and a start symbol.

G$($Vt$,$Vn$,$S$,$P$)$

A set of symbol replacement rules that describe how a program can be broken down into constituent parts.

T$0$ grammar

A grammar whose rules do not depend on context within the string. Typically used to define programming languages.

context$-$free grammar

A feature of regular expressions that signifies zero or more replications of an expression.

Kleene star

Part of language design that deals with the meaning of language constructs.

semantics

Second phase of a compiler that uses a grammar to break down a string of symbols both checking for correctness and determining structure.

parser

Every grammar that can be processed by a Touring machine is a member of this language class.

context$-$free grammar

A set of strings of symbols taken from a given alphabet.