The task is to implement part of a linter program using python. Specifically, you must be able t scan for grouping symbols ( "()", "[", "{}") and ensure that there are no hanging open symbols o stray closing symbols in the source file. • There will be files you will need to scan so you need the open() in your code. Also, you can use the read() or readlines() to know which lines has no opening or stray closing symbols. Example: You scan this code from a file, and you notice that there is a stray closing symbol ")". 1 int main(void) { 123 & 2 3 4 printf("Hello world")); return 0; } The implementation must involve recursion in terms of scanning for the scope. If a different closing symbol is encountered or the end of file is reached, the error message "Line missing closing symbol for "" should be displayed. For stray closing tags, the message "Line : stray closing symbol for "". Do not use "stack" in your code.

The task is to implement part of a linter program using python. Specifically, you must be able t scan for grouping symbols ( "()", "[", "{}") and ensure that there are no hanging open symbols o stray closing symbols in the source file. • There will be files you will need to scan so you need the open() in your code. Also, you can use the read() or readlines() to know which lines has no opening or stray closing symbols. Example: You scan this code from a file, and you notice that there is a stray closing symbol ")". 1 int main(void) { 123 & 2 3 4 printf("Hello world")); return 0; } The implementation must involve recursion in terms of scanning for the scope. If a different closing symbol is encountered or the end of file is reached, the error message "Line missing closing symbol for "" should be displayed. For stray closing tags, the message "Line : stray closing symbol for "". Do not use "stack" in your code.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

The task is to implement part of a linter program using python. Specifically, you must be able to scan for grouping symbols ( "()", "[]", "{}” ) and ensure that there are no hanging open symbols or stray closing symbols in the source file. The implementation must involve recursion in terms of scanning for the scope. If a different closing symbol is encountered or the end of file is reached, the error message "Line : missing closing symbol for "" should be displayed. For stray closing tags, the message "Line : stray closing symbol for "". Note: Do not use "stack" in your code.
Using a csv file attached (https://file.io/NMvbdnv4E3r0), Create a program on python that use the csv file. The program should accept a user's input of a compound. It should output the molar mass (in 2 decimal places only) of the compound.by using the csv file to compute for the atomic mass at name of the elements. Furthermore, if the "elements involved" are wrong an invallid message should be outputted and only existing chemical symbols are the output. The same goes for wrong input of the "number of atoms" wherein a wrong an invallid message should be outputted and only integers are to be inputted by the user. Program should look like this: Enter compound: C6H12O6 Enter elements involved: C,H,O Enter no. of Carbon atoms: AA Enter no. of Hydrogen atoms: 12 Enter no. of Oxygen atoms: 6 Wrong input of number of atoms! Try again. or Enter compound: C6H12O6 Enter elements involved: C,H,O Enter no. of Carbon atoms: 6 Enter no. of Hydrogen atoms: 12 Enter no. of Oxygen atoms: 6…
Problem Y: Implement the reader writer problem using pthreads and semaphores. You should allow multiple readers to read at the same time and only one single writer to write to the data set. You are required to use the following: 1. A semaphore rw_muter initialized to 1. 2. A semaphore muter initialized to 1. 3. An integer reader_count initialized to 0.
Give an example of a C++ code snippet that performs some operation on an array (e.g. sort, search, fill, modify, etc). You should have at least six lines of executable C++ code and your code should be different than anyone else's. Then state the runtime of your code snippet, but don't state what the algorithm is.
An “inverted file” is a critical data structure for implementing applications like the index of a book, or a web search engine. Given a document D (which can be viewed as an unordered, numbered list of words), an inverted file is an ordered list of words L such that for each word W in L, we store the indices of the places in D where W appears. Write a C# program (from scratch please, written by yourself (ask instructor if you are stuck), not borrowed from any other sources) that reads in a list of words separated by spaces from a text file, then uses an efficient O(N) algorithm to create the inverted file index (hint: consider the topic of this chapter, consider using a Dictionary/hashtable to help you), and writes this index out to another file or prints it to the screen. Each line of the output file should start with the next word (the words should be listed in alphabetical order, and this sorting does not have to be part of the O(N) runtime complexity, e.g. you can use regular…
Please you need Implement quicksort in a JAVA programming language. The first version will use the first element of the array as the pivot. Please help me with a Java code , It needs to take the input from a file of 100 data elements. Can someone please help me with this coding problem. I have the data set file , but I cannot upload it in here. Kindly help me with the code. ????
The goal of this second exercise is to develop a better understanding of the Linuxinterprocess communication mechanisms. This would require you to write twoprograms P1 and P2. The first program P1 needs to generate an array of 50random strings (of characters) of fixed length each. P1 then sends a group offive consecutive elements of the array of strings to P2 along with the ID’s ofthe strings, where the ID is the index of the array corresponding to the string.The second program P2 needs to accept the received strings, and send backthe highest ID received back to P1 to acknowledge the strings received. Theprogram P2 simply prints the ID’s and the strings on the console. On receivingthe acknowledged packet, P1 sends the next five strings, with the string elementsstarting from the successor of the acknowledged ID. The above mechanism needs to be implemented FIFO and UNIX DOMAIN SOCKETS. Please note that you may NOT make assumptions about the reliability of the interprocess communication…
In this programming exercise you will implement two functions. The first function will prompt the user for a file containing the number of vertices and entries of the adjacency matrix of a graph. It will return a two-dimensional list (a list of lists) containing the adjacency matrix. The second function will take as input the a two-dimensional list that represents the adjacency matrix of a graph, runs Prim's algorithm, and returns the list of edges in a minimal spanning tree and the total weight of the spanning tree. I have figured out the first part of the program. i need help with the second part. Thanks text file 80 1 2 3 100 100 100 1001 0 2 100 3 4 100 1002 2 0 4 4 100 5 1003 100 4 0 100 100 4 100100 3 4 100 0 3 3 3100 4 100 100 3 0 100 1100 100 5 4 3 100 0 2100 100 100 100 3 1 2 0
write a program that uses a for loop. You’ll need to be able to explain it (not just send the code). In particular, explain how the loop works, and how the different forms of loop (for, for/list, for/vector, etc) are different from one another (this will require some experimentation to find out what each one does). Using racket
Write code for below problem. The input below is just an example and you should implement independent from the input. You will have an orthogonal triangle input from a file and you need to find the maximum sum of the numbers according to given rules below; 1. You will start from the top and move downwards to an adjacent number as in below. 2. You are only allowed to walk downwards and diagonally. 3. You can only walk over NON PRIME NUMBERS. 4. You have to reach at the end of the pyramid as much as possible. 5. You have to treat your input as pyramid. According to above rules the maximum sum of the numbers from top to bottom in below example is 24. *1 *8 4 2 *6 9 8 5 *9 3 As you can see this has several paths that fits the rule of NOT PRIME NUMBERS; 1>8>6>9, 1>4>6>9, 1>4>9>9 1 + 8 + 6 + 9 = 24. As you see 1, 8, 6, 9 are all NOT PRIME NUMBERS and walking over these yields the maximum sum.
Write a program in C++ that can perform encryption and decryption using an arbitrary substitution cipher. In this case, the encrpyion array is a random shuffling of the letters in the alphabet. Your program should generate a random encryption array, its corresponding decryption array, and use these to encode and decode the message.
Java only Design, implement and test a Java class that processes a series of triangles. For this assignment, triangle data will be read from an input file and the program’s output will be written to another file. The output file will also include a summary of the data processed. You must use at least one dialog box in this program. The data for each triangle will be on a separate line of the input file, with the input data echoed and the results referred to by the line number (see example). On initialization, the program will prompt the user for both an input and an output file. If a non-existent input file is specified, the appropriate exception must be handled, resulting in an error message. For the exception case, re-prompt the user for the correct input file. Once the I/O file is specified, the program will read in and process all the entries in the file. The output of the program will be written to the specified output file and echoed to the console. The program will…