In formal language theory, what is the name for the set of symbols from which strings of a formal language may be formed?

In formal language theory, what is the name for the set of symbols from which strings of a formal language may be formed?

• A. Alphabet
• B. Lexicon
• C. Grammar
• D. Syntax

Answer: (A)

The set of symbols from which strings can be formed is called the alphabet. In formal language theory, the alphabet is a finite, nonempty collection of characters, and strings are built by concatenating symbols from that set. The language itself consists of the strings that are allowed according to a given grammar. For example, an alphabet might be {0, 1}, and strings like 0101 or 111 are formed from those symbols, with the grammar determining which of those strings belong to the language. Lexicon, in contrast, refers to vocabulary in natural language; grammar and syntax relate to rules and structure, not the basic pool of symbols themselves.

The set of symbols from which strings can be formed is called the alphabet. In formal language theory, the alphabet is a finite, nonempty collection of characters, and strings are built by concatenating symbols from that set. The language itself consists of the strings that are allowed according to a given grammar. For example, an alphabet might be {0, 1}, and strings like 0101 or 111 are formed from those symbols, with the grammar determining which of those strings belong to the language. Lexicon, in contrast, refers to vocabulary in natural language; grammar and syntax relate to rules and structure, not the basic pool of symbols themselves.