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.

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.

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. 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.
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…
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.
Assume that L is a list of Boolean values, True and False. Write a program in python with a function longestFalse(L) which returns a tuple (start, end) representing the start and end indices of the longest run of False values in L. If there is a tie, then return the first such run. For example, if L is False False True False False False False True True False False 0 1 2 3 4 5 6 7 8 9 10 then the function would return (3, 6), since the longest run of False is from 3 to 6.
Write a C++ program that searches for "anagrams'' in a dictionary. An anagram is a word obtained by scrambling the letters of some string. For example, the word "pot'' is an anagram of the string "otp." For this solution you must not use recursion. Instead, use the std::next_permutation function in the algorithm library. Here is a downloadable link to the words.txt file, but you must be logged in to a google account for it to show up: https://drive.google.com/file/d/1GSIp0R224wnJUARW1qj1AnBWKO-cZyS8/view?usp=sharingHere is a sample of how the program might work:Please enter a string for an anagram: optMatching word optMatching word potMatching word top Here is another sample of how the program might work:Please enter a string for an anagram: blahNo matches foundYou must write these two functions with the exact same function signature (include case):int loadDictionary(istream &dictfile, vector<string>& dict);Places each string in dictfile into the vector dict. Returns the…
write a c++ code using stack,linked list. In quiz game, questions are chosen in such a a way that they cover all fields of a typical quiz contest. The user’s general knowledge is tested with quiz questions regarding science, technology, movies, sports, general health, geography and many more. Quiz Game Project Introduction: Functions of projects and below is some function used in project:- Edit score--adds the prize won to the previous one upon giving the right answer to a question Help-- menu with game summary and rules Show record--shows the highest cash prize won by a particular user Show score--to view the highest score Reset score--to reset the highest score/ default In quiz game project, we can store the user’s name, view the highest score secured by a user, and even reset the score. The game ends when the user’s cash prize piles up to 1000 RS. For each question there are 4 options A, B, C and D and no negative markings. so, money would not be…
using python In a jupyter notebook, implement a recursive function anagrams() that computes anagrams of a given word. An anagram of word A is word B that can be formed by re-arranging the letters of A. For example, the word pot is the anagram of the word top. Your function will take as an input the name of a file of words and as well a word, and print all the words in the file that are anagrams of the input word. Used the attached file words.txt as your file of words. words.txt Points for handling base case, a step that brings you closer to solving the problem, and correctly reading from the file. >>> anagrams("words.txt, trace) crate cater react
Language is C++ The purpose of this project is to test your ability to use files, strings (Strings?), and libraries effectively in program design. A popular past-time is the word search puzzle (if you don't believe me, look in your daily paper and in the news stand in the check-out line at the grocery store). In such a puzzle, a grid of letters is presented which presumably contains words. However, the words are cleverly hidden among the other letters. Their camouflage is aided by them being aligned in many different orientations: horizontal, vertical, diagonal, and sometimes even backwards! The person's goal is to find the words and circle each one. Most often the person is also given a list of the words which should be found: apple hananabs pear mpearoap banana npsgrape grape uleapnbm orange aenuraol agrafnel epanqust bananais located backwards across the top row. appledrops down from the last ain banana. pearis forwards from the first pin apple. grapeis on the line below this.…
Implement a recursive function void deleteMax() on the IntList class (provided). The function will delete from the IntList the IntNode containing the largest value. If there are multiple nodes containing this largest value, only delete the 1st one. Be careful not to cause any memory leaks or dangling pointers. You may NOT use any kind of loop (must use recursion). You may NOT use global or static variables. You may NOT use any standard library functions. Ex: list: 5->7->1->16->4->16->3 list.deleteMax(); list: 5->7->1->4->16->3 IntList.h #ifndef __INTLIST_H__#define __INTLIST_H__ #include <ostream> using namespace std; struct IntNode {int value;IntNode *next;IntNode(int value) : value(value), next(nullptr) {}}; class IntList { private:IntNode *head; public: /* Initializes an empty list.*/IntList() : head(nullptr) {} /* Inserts a data value to the front of the list.*/void push_front(int val) {if (!head) {head = new IntNode(val);} else {IntNode…
In C++, write a program that outputs the nodes of a graph in a breadth first traversal. Data File: Please use this data file. Text to copy: 100 1 3 -9991 4 -9992 5 -9993 2 -9994 -9995 7 8 -9996 4 7 -9997 -9998 -9999 7 8 -999 Diagram: Also, please take a look at figure 20-6 on page 1414 and calculate the weights for the following edges: 0 -> 1 -> 4 0 -> 3 -> 2 -> 5 -> 7 0 -> 3 -> 2 -> 5 -> 8 6 -> 4 6 -> 7 9 -> 7 9 -> 8 To calculates these weights, please assume the following data: 0 -> 1 = 1 0 -> 3 = 2 1 -> 4 = 3 3 -> 2 = 4 2 -> 5 = 5 5 -> 7 = 6 5 -> 8 = 7 6 -> 4 = 8 6 -> 7 = 9 9 -> 7 = 10 9 -> 8 = 11
Create a recursive function in a file called ab_equality.py: def ab_equal(n, k, current): Print out all of the strings of a's and b's of length n so that the number of a's and b's are equal. For n = 2, there's ab and ba. For n = 3 there are no strings since they'd have to have 2 a's and 1 b, or 2 b's a 1 a so not equal. For n = 4, there will be 6 of these strings, and for n = 5, zero again. Hint: use k to track the difference between a's and b's. So for instance if your current is aaabb then k should be equal to either 1 or -1 (your choice depending). When you call the function, you should call it from your main or testing function with the length in the n parameter, 0 should be put into the k parameter, and then an empty string will be passed in for current.
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…