SYNTAX ANALYSIS
ROLE OF THE PARSER
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
L+
|
|
|
L*
|
|
|
L
|
|
|
L-
|
Detailed explanation-1: -L∗, the Kleene Closure of L: set of strings formed by taking any number of strings (possibly none) from L, possibly with repetitions and concatenating all of them. If L = 0, 1, then L0 = , L2 = 00, 01, 10, 11.
Detailed explanation-2: -The closure of a language L is denoted L∗ and represents the set of those strings that can be formed by taking any number of strings from L, possibly with repetitions (i.e., the same string may be selected more than once) and concatenating all of them.
Detailed explanation-3: -Kleene Closure / Plus Definition − The set ∑+ is the infinite set of all possible strings of all possible lengths over ∑ excluding .
Detailed explanation-4: -L* denotes Kleene closure and is given by L* = U Li i=0 example : 0* =, 0, 00, 000, ………………………………… Language includes empty words also. L+ denotes Positive closure and is given by L+= Li i=1 example:0+=0, 00, 000, ……………………………………..
Detailed explanation-5: -L () = ) is a Regular Expression denoting an empty language. ( L () = ) x is a Regular Expression where L = x If X is a Regular Expression denoting the language L(X) and Y is a Regular Expression denoting the language L(Y), then.