Q. If R is regular language and Q is any language (regular/ non regular), then Pref (Q in R) is _____________

View solution

Q. String generated by
S->aS/bA,

A->d/ccA

View solution

Q. If a ‘/’ is used before a character that has no special meaning, ‘/’ is ignored.

View solution

Q. ___________ Are automatically treated as regular expressions.

View solution

Q. You can use RE, if you expect the value of a property to change in an unpredictable way each time its run.

View solution

Q. RE can be used only for values of type string and number.

View solution

Q. A regular expression enables a quick test to determine objects and text strings with undependable values.

View solution

Q. Which concept of grammar is used in the compiler

View solution

Q. If we compile the sam.c file with the command “gcc -o sam sam.c”, then the executable file will be

View solution

Q. __________ was developed from the beginning as a cross compiler

View solution

Q. The __________ is a technique for building cross compilers for other machines

View solution

Q. Is GCC a cross Complier

View solution

Q. Cross compiler is used in Bootstrapping.

View solution

Q. Regular Expressions can be used with XML checkpoints.

View solution

Q. All __________ are automatically treated as regular expressions.

View solution

Q. What is the Regular Expression Matching Zero or More Specific Characters

View solution

Q. Regular expressions can be used only for values of type string and number.

View solution

Q. Which of the following strings is not generated by the following grammar?
S → SaSbS|ε

View solution

Q. Given a NFA with N states, the maximum number of states in an equivalent minimized DFA is at least.

View solution

Q. Consider the following two statements:
S1: { 02n |n >= l} is a regu1ar language

S2: { 0m 0n 0(m+n) l m >= 1 and n >= 2} is a regu1ar language

Which of the following is true?

View solution