The finite state machine (FSM): b B generates the regular language, L = {a"b" | a 2 1 and m 2 2}. Implement the above FSM as a C++ function, int is_abb(char * str) { II C++ code here } that returns a 1 if the given string, str, is in L and returns a 0 if str is not in L. Assume the existence of a C++ function, int str_len(char * str), which returns the of the given string, str.

The finite state machine (FSM): b B generates the regular language, L = {a"b" | a 2 1 and m 2 2}. Implement the above FSM as a C++ function, int is_abb(char * str) { II C++ code here } that returns a 1 if the given string, str, is in L and returns a 0 if str is not in L. Assume the existence of a C++ function, int str_len(char * str), which returns the of the given string, str.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Write a recursive function that lists al of the two-element subsets of a given set of letters in the folowing format. For example, when twoElementSubsets takes "ACEG"as parameter, wil print twoelement-subsets in the folowing format (A, C) (A, E) (A, G) (C, E} (C, G) E. G) Write a C program to test your function. Read the string (a set of letters) from he user. The number of parameters that twoElementSubsets function may take depends on your recursive function de sign. Sample Inputi ACEG Sample Outputi: (A C) (A. E) (A G) (C. E) (C. G) (E. G)
Write a program to find the sumof all non-prime numbers fromm and n (including m and n also)using the concept of passingpointers to function. Passaddresses of m, n and sumintegers from the main ()function to the user definedfunction: calculate () [Function isnot returning any value], anddisplay the sum in the main ()function.Answer the question in c language.
Write a C function strSumNums() that takes a string as parameter, computes and returns the sum of numbers in the string.This function can call a function that returns the address of first digit character in a string.Example: "CS101 and CS363 are 2 CS courses." → 466 (= 101 + 363 + 2)Prototype:int strSumNums(char str[]);
The finite state machine (FSM): a B generates the regular language, L = {a*b" | a 2 1 and m 2 2}. Implement the above FSM as a C++ function, int is_abb(char * str ) { II C++ code here } that returns a 1 if the given string, str, is in L and returns a 0 if str is not in L. Assume the existence of a C++ function, int str_len(char * str), which returns the length of the given string, str. 9.
Write a C function strEven() that takes two strings (say s1, s2) as parameters, stores into s2 the even indexed (0th, 2nd, 4th, ...) characters of s1. s2 must be null character terminated. Example: if s1 is "Abcde1234", the function will make s2 as "Ace24" Prototype: void strEven(char s1[], char s2[]);
2. Write the definition of a bool function named BooleanMode () whose header is bool BooleanMode (bool data[), int n) Given that n represents the size of data, the function returns the truth value that appears the most in data. If there is an equal number of both truth values in data, the function returns the truth value that appeared first. For instance, if data = [true, true,false, false,false, true,falsel, then the function will return false. Impl
Write a C++ function, bool ok(int q[]), which takes an array q and returns true if the array represents a valid configuration of the eight queens and returns false otherwise.
Code this in C program A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively.For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. For example: if s = {3,4,6,8}, the array looks like this: 0 1 2 3 4 5 6 7 8 9 FALSE FALSE FALSE TRUE TRUE FALSE TRUE FALSE TRUE FALSE Implement a programmer-defined data type called BitSet to represent a set as follows:typedef int BitSet[MAX];Implement the following functions:void initialize(BitSet s); - set all array elements to FALSEvoid add(int elem,BitSet s);- set the item indexed by elem to TRUEvoid display(BitSet s);- display the set on the screen using set notation,…
Define a Python 3 function shuffle_language (A, B) that returns the shuffle A||B of languages A and B. Return the result as a set of strings, that is, without duplicates. If you want to use your function from the previous question, you will need to include it as part of your answer to this question. For example: Test Result print (sorted (shuffle_language({'ab'}, {'cd', 'e'}))) print (sorted (shuffle_language({}, {'aa', 'ab', 'bb'}) ) ) [] ['abcd', 'abe', 'acbd', 'acdb', 'aeb', 'cabd', 'cadb', 'cdab', 'eab']
Given a string S of characters, write a C function countAndPrint that prints on the screen all the substrings of n characters that contain 2 vowels (remember that in C there is no library function that determines whether a character is a consonant or a vowel, it must be implemented from scratch). The prototype should be the following: void countAndPrint (char str[], int n); Example: if S="forExample" e n= 4, the substrings that are 4-characters long and contain 2 vowels are: "forE", "orEx", "rExa" and "Exam".
Write a C++ recursive program that checks if two vectors of type int are anagrams of each other. You are not allowed any additional functions except vector functions. Using loops is also prohibited. bool isAnagram(vector a, vector b, startindex=0) You can use only this additional function: bool isFound(const vector &a, const int &x) { for (int i = 0; i < a.size(); i++) if (a[i] == x) return true; return false; }
Let x be a Lisp variable whose value is a proper list, of length 5000, whose elements are all numbers. Suppose another programmer has defined a Lisp function FUNC such that the function call (FUNC v) returns T Or NIL whenever the value of v is a number. If we know nothing else about the function FUNC, which one of (A) - (E) below is a correct statement about the value of (mapcar #'func X) ? O A. The value of (mapcar #'func X) must be a proper list, and the length of the list must be less than 5000. O B. The value of (mapcar #'func X) must be a proper list, and the length of the list may be less than 5000 or may be equal to 5000. o. The value of (mapcar #'func X) must be a proper list of length 5000. O D. The value of (mapcar #'func X) need not be a list. O E. The value of (mapcar #'func X) must be a proper list, and the length of the list may be greater than 5000 or may be less than 5000 (but cannot be equal to 5000).