adplus-dvertising
frame-decoration

Question

If every aRb implies bRa then a relation R will be a symmetric relation.

a.

True

b.

False

c.

May be

d.

Can't say

Posted under Compiler Design

Answer: (a).True

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. If every aRb implies bRa then a relation R will be a symmetric relation.

Similar Questions

Discover Related MCQs

Q. R is said to be reflexive if aRa is true for every a in A;

Q. The production of the form no terminal → Λ is said to be null production.

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

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

A->d/ccA

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

Q. ___________ Are automatically treated as regular expressions.

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

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

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

Q. Which concept of grammar is used in the compiler

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

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

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

Q. Is GCC a cross Complier

Q. Cross compiler is used in Bootstrapping.

Q. Regular Expressions can be used with XML checkpoints.

Q. All __________ are automatically treated as regular expressions.

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

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

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