Explain the reasons why programmers these days prefer to use high level programming languages rather than machine language.
Major Topic
Introduction & Phases of a Compiler
Blooms Designation
UN
Score
5
Obtain the regular expressions for the set {b2, b5, b8, b11, …}, using the appropriate Kleene’s closure.
Major Topic
Regular Grammars
Blooms Designation
UN
Score
5
“In a programming language, keywords, constants, identifiers, strings, numbers, operators and punctuations symbols can be considered as tokens”.
Identify and explain the five tokens in the variable declaration line in C programming language below:
str value = “Alibaba Corporation”;
Major Topic
Introduction & Phases of a Compiler
Blooms Designation
UN
Score
5
4. You are given the following production rules for a Context-free Grammar (CFG)
S aS | aB | AB
AaA | a
B bB | λ
Show that the language L = {anbn : n ≥ 1} can be generated from the above CFG.
Major Topic
Context-Free Grammars
Blooms Designation
UN
Score
5
5. Construct a transition table for the following Non-deterministic Finite Automata (NFA) for strings containing {0,1}:
Major Topic
Finite Automata
Blooms Designation
UN
Score
5
for clarity, utilize the attached images
