INTRODUCTION TO COMPILER DESIGN
OVERVIEW OF COMPILERS
|
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. A language is a set of strings over 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 set of symbols. Alphabets are denoted by . A string over an alphabet is a finite sequence of symbols from the alphabet. Example: If is 0, 1 then 01101 is a string 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 .