16. A grammar can be expressed in BNF notation. There are two types of symbols i

Question

16. A grammar can be expressed in BNF notation. There are two types of symbols in BNF expressions. Non-terminal symbols are typically A. Abstract concepts that need to be further defined B. The symbols that would appear in a grammar file C. The symbols that would appear in a source code file D. Metasymbols that are used by BNF grammar types to help describe rules 17. Which of the following scripting languages is a pure object-oriented language: A.. Ruby B. Python C. Perl D. JavaScript was: A. Smalltalk B. C++ C. Java

Explanation / Answer

16> C

The Symbol that would appear in a source code file

17>A

Ruby

18>A

SmallTalk

Related Questions

Navigate

• Browse (All)
• Browse 1
• Subjects

---