Question

I need help with the following problems, any help you can provide is deeply appreciated!

CSC 404 Exam 1 Question I continued - 9. The syntax rules for most languages ignore spaces. An exception is which tises indents and therefore spaces to form the indents) to group statements (a) FORTRAN (6) Pascal (e) Python (d) Lip (e) C++ 10. Identifiers, constants and operators are typical examples of (a) tokens. (b) leafons. (c) signifiers. (d) lexicons. (e) parsicles. 0) non-terminals. 11. Regular expressions are used to define (a) non-terminals (6) statements (e) expressions (d) tokens 12. Which is an example of the equivalence of program and data? (a) Operating systems may be configured at boot time. (0) A spreadsheet computes and displays the values of formulas. (c) A compiler reads the source program as input. (d) Symbolic math performed by a computer program. 13. Backus-Naur Form and Context-Free Grammars (a) are used to describe syntax and semantics, respectively. (6) function the same way, but use different notation. (c) are used to describe different aspects of programming language syntax. (d) present radically different approaches to describing syntax. 14. A CFG is ambiguous exactly when (a) at least one string has two different parse trees. (6) any string which cannot be derived from the CFG has a parse tree. (c) there are at least two strings each having different parse trees (d) every string which can be derived from the CFG has more than one parse tree. 15. When performing a BNF derivation, how do you know when to stop? That when have you produced a string in the language? (a) Any time after you introduce at least one terminal symbol. (6) Any time you like; any string of symbols derived from the start symbol is in language. (C) When you produce a string entirely of terminal symbols. (d) Any time after a terminal symbol appears in the leftmost position. 16. Consider this small grammar. SAA

Answer 1

Page No.1 Rove.com Part-(Al option-c Python Python language use identation techique to foum indents to group statement in order to make code look more readable and understandable. Part (B) option - a Tokens Identifiers Constants and operatere generally fall in category of detentifiers Tokens which is defined as smallest element of a peguam which is meaningful to the compiler Paut fc) Optiorf A) Que used ito describe lyntax and semantės respectiely a Pavetto) option-A at least one string has tuo different pause tree. CFG is said to be ambigious if there exists more than one pause tree for a given input string.