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. b, a and aabab are examples of string over alphabet a, b and 0, 10 and 001 are examples of string over alphabet 0, 1.
Detailed explanation-2: -A string is a finite sequence of symbols selected from some alphabet. It is generally denoted as w. For example for alphabet ∑ = 0, 1 w = 010101 is a string. Length of a string is denoted as |w| and is defined as the number of positions for the symbol in the string.
Detailed explanation-3: -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. Example 3.1. =0, 1 is an alphabet, and 011, 1010, and 1 are all strings over .
Detailed explanation-4: -An alphabet is a finite, nonempty set of symbols called characters. Typically, we use the symbol to refer to an alphabet. A string over an alphabet is a finite sequence of characters drawn from . The empty string has no characters and is denoted .
Detailed explanation-5: -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.