# must be excel in Grammar and infinite Prgramming

# We're the ideal place for homework help. If you are looking for affordable, custom-written, high-quality and non-plagiarized papers, your student life just became easier with us. Click either of the buttons below to place your order.

Order a Similar Paper Order a Different Paper

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 the starting state S. S → A | BC | Ca → aB | b | cBB → cB | CBb → 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 → AbB | bAc → Ab | aBB → 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’s, followed by an even number of c’s, followed by a number of e’s equal to the number of a’s plus c’s. 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.

## Do you need academic writing help? Our quality writers are here 24/7, every day of the year, ready to support you! Instantly chat with a customer support representative in the chat on the bottom right corner, send us a WhatsApp message or click either of the buttons below to submit your paper instructions to the writing team.

Order a Similar Paper Order a Different Paper