language of octal (base 8) numerals

What you need to do:1. Type that code up and run it to make sure that it is doing what it is supposed to do. Provide the strings in the header of the program when prompted.2. Use the logic in that program to design your own Recursive Descent parser in C for the following grammar:S →aABA →Abc | bB →d3. Make sure that you choose at least two strings that pass the grammar and one string that does not pass the grammar just like I did in the model program4. Submit both the code and a screen shot of your results for the choice of strings that you provided. Below is the C code that can be used to implement a Recursive Descent parser for the above grammar/* Recursive Descent Parser for the Expression Grammar:S → (L) |aL' →,SL'|εL → SL'Valid inputs: (a,(a,a)) and (a,((a,a),(a,a)))Invalid inputs:(aa,a)*/#include <stdio.h>#include <string.h>int S(), Ldash(), L();char *ip;char string[50];int main()               {printf("Enter the string\n");scanf("%s", string);ip =…

Describe the concept of the abstract syntax tree (AST), and solve the following statement: for(a=10 ; a < 100 ; a+5) Print a;

C++ Consider the language that the following grammar defines: <S> =  c | <W> | c<S> <W> = abb|a<W>bb Write all strings that are in this language and that contain seven or fewer characters. If the answer includes multiple strings, you must enter the answers in alphabetical order. A. In alphabetic order, what are the two strings in this language that are 3 characters in length? B. In alphabetic order, what are the two strings in this language that are 4 characters in length? C. In alphabetic order, what are the two strings in this language that are 5 characters in length?

Please written by computer source

Given the language above, create a context free grammar for L

In this problem you are provided with a CFG/BNF and you are to determine which of the following strings are inside of the described grammar G defined by G={V,E,R,S} where V={ } E = { a, b } R=[ --> aa | bb|a] S= aa aaa a bab bb aabbabbaa bbbbbabbbb bbbbbabbbbb

(1) Fill the blanks to complete the following sentences that describe the relations between regular expression, regular language, and regular gramma. You can also use your own statements to describe the relations. there is an NFA machine to (i) A language L is regular (ii) A language L is regular (ii1)A language L is regular it. there is a regular expression r to it. there is a regular grammar G to it.