logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Why is it useful for a programmer to have some background in language design, even though he/she may never actually design a programming language?

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

1. (10%) Conceptual – answer these in full sentences. Lecture material should suffice as resources for this, and the textbook is also quite helpful.

 

a) Why is it useful for a programmer to have some background in language design, even though he/she may never actually design a programming language?

b) What makes the Von Neumann architecture more suitable, in terms of efficiency, for imperative programming over functional programming?

c) What is the bottleneck that limits the speed of compilation-based implementation methods, versus that of pure interpretation?

 

2. (50%) Programming:

For this part, you may need to install the gcc compiler to be able to perform compilations on your c programs in the command prompt. For Windows, follow these instructions: https://www.guru99.com/c-gcc-install.html.

For Linux: https://linuxize.com/post/how-to-install-gcc-compiler-on-ubuntu-18-04/

 

a.) Write an introductory C program that outputs the factorial of a user inputted integer, n, on prompt. Write two distinct factorial methods, factorial_rec and factorial_it, performing the factorial using a recursive and iterative method, respectively. In addition, output the time it took to complete the call for some example input. You might want to use the clock() function which is available in the time.h library in C. Example usage:

 

#include <time.h> clock_t start, end; double cpu_time_used; start = clock();

... /* Do the work. */ end = clock();

cpu_time_used = ((double) (end - start)) / CLOCKS_PER_SEC;

 

In a single c file, create a main program that will output the factorial (and time of completing the method) of a user inputted integer in prompt (i.e., using scanf). Once compiled, the output upon execution would look like:

 

 

b) Notice that the time it seems to take to perform the methods on a small integer like 3 seems both minimal and equal between both methods. Find and report a large enough integer (if any) along with the time of execution that may suggest a difference in efficiency between both methods. If a difference does exist between recursive and iterative calls, explain why.

 

c) Compile the same C program you wrote to assembly code (extension is .s) using the gcc -S command:

gcc -S factorial.c.

You can compile the assembly code to executable with the command:

gcc -c factorial

 

Now, look over the assembly code (i.e., factorial.s), and report the total number of instructions (lines) that pertain to the factorial_it method versus that of the factorial_rec method. Comment on any similarities/differences. You may also take a screenshot of the segments of code relevant to each.

 

 

Also submit factorial.c and factorial.s in a .zip file. Not doing so will result in a 0 for the question.

 

 

3.(40%) Theoretical

a) Rewrite the grammar here to prioritize + over * and make the + operator right associative.

<assign> → <id> = <expr>

<id> → A | B | C

<expr> → <expr> + <term>

| <term>

<term> → <term> * <factor>

| <factor>

<factor> → ( <expr>)

| <id>

 

b) Using the following grammar, show whether it is possible to generate a parse tree for the statements given. If so, show its leftmost derivation.

<assign>  <id> = <expr>

<id>  A | B | C

<expr>  <expr> + <term> | <term>

<term> <term> * <factor> | <factor>

<factor>  ( <expr> ) | <id>

1. A = A * B + C * A

2. A = B + C * (A + B)

 

 

(5/5)
Attachments:

Expert's Answer

984 Times Downloaded

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

984 Times Downloaded

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

621 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

802 Answers

Hire Me
expert
Husnain SaeedComputer science

988 Answers

Hire Me
expert
Atharva PatilComputer science

565 Answers

Hire Me
August
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
27
28
29
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
5
6
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30