6. Construct the PDA for the language L={a'b'c*, with j=2i or j=2k and i.j,k20}

1] Write a simple C/C++ program that shows that C/C++ does not check the index range for static one-dimensional arrays, and briefly explain how the program is supposed to check it. 2] Write a simple program in Python to detect whether the scoping of variables is static or dynamic, and briefly explain how the program is supposed to check it.

In C language.  Please don't copy similar programs from, bartleby or chegg Define a structure type auto_t to represent an automobile. Include components for the make and model (strings), the odometer reading, the manufacture and purchase dates (use another user-defined type called date_t), and the gas tank (use a user-defined type tank_t with components for tank capacity and current fuel level, giving both in gallons). Write I/O functions scan_date, scan_tank, scan_auto, print_date, print_tank, and print_auto, and also write a driver function that repeatedly fills and displays an auto structure variable until input is -30. Note: Each record has a number (1, 2, 3 ...),once the program scans record number -30, it should terminate without processing it. SAMPLE RUN #4: ./Structures Interactive Session Show Invisibles Highlight: Enter record number:1 Enter Make:Mercury Enter Model:Sable Enter Odometer Reading:99842 Enter Month:1 Enter Day:18 Enter Year:2001 Enter Month:5 Enter Day:30…

Please help c++language

Design a NFA for the language: L: {an| n is even or divisible by 3} Which of the following methods can be used to simulate the same.   i. e-NFA ii. Power Construction Method iii. Both (a) and (b) iv. None of the mentioned

1.1 OBJECTIVE:Design a lexical analyzer for given language and the lexical analyzer should ignore redundant spaces, tabs and new lines. It should also ignore comments. Although the syntax specification states that identifiers can be arbitrarily long, you may restrict the length to some reasonable value. Simulate the same in C language.   1.2 PROGRAM LOGIC:   Read the input Expression        2. Check whether input is alphabet or digits then store it as identifier        3. If the input is is operator store it as symbol        4. Check the input for keywords