COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Alphabets
|
|
|
Strings
|
|
|
Numbers
|
|
|
Special Symbols
|
Detailed explanation-1: -A string (also called a word) is a finite sequence of symbols of an alphabet.
Detailed explanation-2: -In formal language theory, an alphabet is a finite, non-empty set. The elements of the set are called symbols. A finite sequence of symbols a1a2…an from an alphabet is called a string over that alphabet.
Detailed explanation-3: -An alphabet is a finite, nonempty set. No matter what alphabet we are working with at any time, we call its members symbols. It is reasonable that we must have at least one symbol (so an alphabet is not allowed to be empty), and we do not have infinitely many symbols.
Detailed explanation-4: -A string is a finite sequence of symbols drawn from some alphabet. A language is any set of strings. The empty string is denoted . A finite automaton (FA) is a device that recognizes a language.
Detailed explanation-5: -Symbol: A symbol is a user-defined entity. Alphabet: An alphabet is a finite set of symbols denoted by in automata. Alphabets are a set of symbols used to construct a language. Example, 0, 1 is binary alphabet, A…, Z, a… z is the alphabet set for the English language.