\n must be excel in Grammar and infinite Prgramming\n <\/p>\n<\/div>\n
must be excel in Grammar and infinite Prgramming must be excel in Grammar and infinite Prgramming must be excel in Grammar and infinite Prgramming (10 points) Create a NFA and a regular expression for a Floating point literal in GO LANG. HOw would a DFA be different? (5 points) Write 5 possible strings of size 6 and the way you get there from […]<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":"","_joinchat":[]},"categories":[1],"tags":[],"_links":{"self":[{"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/posts\/242019"}],"collection":[{"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/comments?post=242019"}],"version-history":[{"count":0,"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/posts\/242019\/revisions"}],"wp:attachment":[{"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/media?parent=242019"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/categories?post=242019"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/qualityassignments.net\/wp-json\/wp\/v2\/tags?post=242019"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n (10 points) Create a NFA and a regular expression for a Floating point literal in GO LANG. HOw would a DFA be different? (5 points) Write 5 possible strings of size 6 and the way you get there from the starting state S. S \u2192 A | BC | Ca \u2192 aB | b | cBB \u2192 cB | CBb \u2192 aBA | b | daB (5 points) Write the smallest if-ifelse-else statement that can be created with Modula 2. (15 points) Given the following Grammar and the right sentential form draw a parse tree. S \u2192 AbB | bAc \u2192 Ab | aBB \u2192 Ac | cBb | c a) aAccbcBb b) baBcBbbbc c)accbcccbb (5 points) Draw the Von Neumann architecture and detail how each portion affects in the compilations process? (5 points) Draw, label and describe the processes for compilation and for interpretation, describe the differences between the two (5 points) Create a state diagram of multi line comments in C (10 points) Count the total number of identifiers in the following Go Lang Code block, AND list the unique ones: package main import “fmt” func sum(nums …int) { fmt.Print(nums, ” “) total := 0 for _, num := range nums { total += num } fmt.Println(total) } func main() { sum(1, 2) sum(1, 2, 3) nums := []int{1, 2, 3, 4} sum(nums…) } Page 2 of 3 60 points Programming Language Concepts Test 1 July 1st, 2019 (10 points) Lexically analyze the following code segment. Give the total number of lexemes. State the token provided for each value ( reserved words, assignment operators, identities, etc. ) int currSum = 0; int oddCount = 0; for(int i = 1; currSum + i <= num; i+=2) { currSum += i; oddCount++; } (10 points) Show the left most derivation and a parse tree for the following GO LANG code: for i, s := range a { \/\/ type of i is int \/\/ type of s is string \/\/ s == a[i] g(i, s) } Remember syntax analysis is done on tokens and not lexemes. You may use lexemes of special symbolsas their token. (10 points) Show the left most derivation and a parse tree for the following RUST code: struct Point {x: i32, y: i32} let p = Point {x: 10, y: 11}; Remember syntax analysis is done on tokens and not lexemes. You may use lexemes of special symbolsas their token. (10 points) Write the formal definition of a language that has and odd number of a\u2019s, followed by an even number of c\u2019s, followed by a number of e\u2019s equal to the number of a\u2019s plus c\u2019s. Page 3 of 3 40 points 1 (5 points) The following EBNF rules describe the syntax of decimal literals in Ada. Draw a state diagram that represents the following rule set.