Design a CFG which recognizes the language L={ w | all the letters on the first half of w are the same, and the second half is a substring where no consecutive letters are the same} over the alphabet I=(0,1,2]. Explain your derivation rules. Note: consecutive means two letters which follow each other," no consecutive letters are the same" means you can't repeat letters, so you can't have "00", "11" or "22" on the second half.

Write code in C++ language

Write a program in js to add key value pair in an object and print that Note that you must use dot notation

Write a program in C that, given two points on a two-dimensional graph, outputs a message (string) if the line that connects them is horizontal or vertical, or if the slope is positive or negative.What would you modify or adjust in your code if we move from a 2D cartesian system to a 3D dimensional cartesian system?You need to take into consideration if the system is 3D and therefore you need to ask the user to insert X, Y , and Z.

Theory of computation: Write a program using c++ and pseudo code to check if the entering value following the grammar or not without checking if the grammar is left recursion or not: E ---> E + T | T T---> T * F | F F---> (E) | i Thanks in advance ( I hope you solve it fast with the right answer if you can't solve it leave it please! )

Write a program in C++ which allows the user to input 3 sets (A,B,C) and to display the cartesian product AxBxC of the 3 sets, and then calculate the number of elements in AxBxC. Keep in mind, if the the input looks like A={a,b,c}, B={1,2,3,4}, C={A,B,C,D,E}, the output should look like “AxBxC = {(a,1,A), … ,(c,4,E)} and it has 60 elements”

Explain an example how the manipulators scientific and fixed work without using the manipulator setprecision.

The following two languages over {0,1} L1: All strings that begin in '00' L2:  All strings that have the substring '1' embedded.

I need help creating this C++ parser program that follows these rules in the image below.

Write an outline and logic for the following code: EMPTY = '-' BLACK = ‘X’ WHITE = ‘O’ BOARD_SIZE = 8 DIRECTIONS = [(0, 1), (0, -1), (1, 0), (-1, 0), (1, 1), (-1, -1), (1, -1), (-1, 1)]   def initialize_board():     board = [[EMPTY for _ in range(BOARD_SIZE)] for _ in range(BOARD_SIZE)]     board[3][3] = WHITE     board[3][4] = BLACK     board[4][3] = BLACK     board[4][4] = WHITE     return board   def print_board(board):     print("   1  2  3  4  5  6  7  8")     for i in range(BOARD_SIZE):         print(f"{i + 1} ", end="")         for j in range(BOARD_SIZE):             print(f" {board[i][j]}", end="")         print()   def is_valid_move(board, row, col, player):     if board[row][col] != EMPTY:         return False       for direction in DIRECTIONS:         dr, dc = direction         r, c = row + dr, col + dc         while 0 <= r < BOARD_SIZE and 0 <= c < BOARD_SIZE:             if board[r][c] == EMPTY:                 break             if board[r][c] == player:…