Recent questions without an upvoted answer / GATE Overflow for GATE CSE

0 votes

0 answers

6781

Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 4 (Page No. 207 - 208)
There is an extended grammar notation in common use. In this notation, square and curly braces in production bodies are metasymbols (like $\rightarrow$ or $\mid$) with the following meanings: Square braces ... can be generated by a grammar with these extensions can be generated by a grammar without the extensions.

There is an extended grammar notation in common use. In this notation, square and curly braces in production bodies are metasymbols (like $\rightarrow$ or $\mid$) with th...

admin

471 views

admin asked Aug 17, 2019

0 votes

0 answers

6782

Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 3 (Page No. 207)
Design grammars for the following languages: The set of all strings of $0's$ and $1's$ such that every $0$ is immediately followed by at least one $1$. The set of all strings of $0's$ and $1's$ that are palindromes; ... $1's$ of the form $xy$, where $x\neq y$ and $x$ and $y$ are of the same length.

Design grammars for the following languages:The set of all strings of $0's$ and $1's$ such that every $0$ is immediately followed by at least one $1$.The set of all strin...

admin

436 views

admin asked Aug 17, 2019

1 votes

0 answers

6783

Ullman (Compiler Design) Edition 2 Exercise 4.2 Question 2 (Page No. 206 - 207)
Repeat Question $4.2.1$ for each of the following grammars and strings: $S\rightarrow 0S1\mid 01$ with string $000111$. $S\rightarrow +SS\mid \ast SS\mid a$ with string $+\ast aaa$ ... $bfactor\:\rightarrow\:not\:bfactor\mid (bexpr)\mid true\mid false$

Repeat Question $4.2.1$ for each of the following grammars and strings: $S\rightarrow 0S1\mid 01$ with string $000111$.$S\rightarrow +SS\mid \ast SS\mid a$ with string $+...

admin

743 views

admin asked Aug 17, 2019

2 votes

2 answers

6784

Square Root Aptitude Doubt
Please help with this question:- $(\sqrt{243}+3)^x+(\sqrt{243}-3)^x=15^x$.

Please help with this question:-$(\sqrt{243}+3)^x+(\sqrt{243}-3)^x=15^x$.

Devshree Dubey

982 views

Devshree Dubey asked Aug 11, 2019

0 votes

0 answers

6785

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 12 (Page No. 128)
SQL allows a rudimentary form of patterns in which two characters have special meaning: underscore (_) stands for any one character and percent-sign (%) stands for any string of $0$ or more characters. In ... to express any SQL pattern as a regular expression, given that we know which character is the escape character.

SQL allows a rudimentary form of patterns in which two characters have special meaning: underscore (_) stands for any one character and percent-sign (%) stands for any st...

admin

344 views

admin asked Aug 5, 2019

0 votes

0 answers

6786

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 11 (Page No. 127 - 128)
The UNIX shell command sh uses the operators in Fig. $3.9$ in filename expressions to describe sets of file names. For example, the filename expression *.o matches all filenames ending in. ... expressions can be replaced by equivalent regular expressions using only the basic union, concatenation, and closure operators.

The UNIX shell command sh uses the operators in Fig. $3.9$ in filename expressions to describe sets of file names. For example, the filename expression *.o matches all fi...

admin

521 views

admin asked Aug 5, 2019

0 votes

0 answers

6787

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 10 (Page No. 127)
The operator ^ matches the left end of a line, and \ ... operators by an equivalent expression that does not use either of these operators?

The operator ^ matches the left end of a line, and \$ matches the right end of a line. The operator ^ is also used to introduce complemented character classes, but the co...

admin

307 views

admin asked Aug 5, 2019

0 votes

0 answers

6788

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 9 (Page No. 127)
The regular expression $r\{m, n\}$ matches from $m$ to $n$ occurrences of the pattern $r$. For example, $a [1, 5]$ matches a string of one to five a's. Show that for every regular expression containing repetition operators of this form, there is an equivalent regular expression without repetition operators.

The regular expression $r\{m, n\}$ matches from $m$ to $n$ occurrences of the pattern $r$. For example, $a [1, 5]$ matches a string of one to five a's. Show that for ever...

admin

254 views

admin asked Aug 5, 2019

0 votes

0 answers

6789

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 8 (Page No. 126 - 127)
In Lex, a complemented character class represents any character except the ones listed in the character class. We denote a complemented class by using ^ as the first character; this ... expression with complemented character classes, there is an equivalent regular expression without complemented character classes.

In Lex, a complemented character class represents any character except the ones listed in the character class. We denote a complemented class by using ^ as the first char...

admin

815 views

admin asked Aug 5, 2019

0 votes

0 answers

6790

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 7 (Page No. 126)
Note that these regular expressions give all of the following symbols (operator characters) a special meaning: \ " . ^ ... the regular expression \*\* also matches the string **. Write a regular expression that matches the string "\.

Note that these regular expressions give all of the followingsymbols (operator characters) a special meaning:\ " . ^ $ [] * + ? {} | /Their special meaning must be turned...

admin

293 views

admin asked Aug 5, 2019

0 votes

0 answers

6791

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 6 (Page No. 126)
Write character classes for the following sets of characters: The first ten letters (up to "j" ) in either upper or lower case. The lowercase consonants. The "digits" in a hexadecimal number (choose either ... we shall discuss extensively in Section $3.5)$. The extended notation is listed in Fig.$3.8$.

Write character classes for the following sets of characters:The first ten letters (up to "j" ) in either upper or lower case.The lowercase consonants.The "digits" in a h...

admin

1.2k views

admin asked Aug 5, 2019

3 votes

0 answers

6792

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 5 (Page No. 125 - 126)
Write regular definitions for the following languages: All strings of lowercase letters that contain the five vowels in order. All strings of lowercase letters in which the letters are in ascending lexicographic order. ... substring abb. All strings of a's and b's that do not contain the subsequence abb.

Write regular definitions for the following languages:All strings of lowercase letters that contain the five vowels in order.All strings of lowercase letters in which the...

admin

2.5k views

admin asked Aug 5, 2019

1 votes

0 answers

6793

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 4 (Page No. 125)
Most languages are case sensitive, so keywords can be written only one way, and the regular expressions describing their lexeme is very simple. However, some languages, like SQL, are case insensitive, so a keyword ... in a case-insensitive language. Illustrate the idea by writing the expression for "select" in SQL.

Most languages are case sensitive, so keywords can be written only one way, and the regular expressions describing their lexeme is very simple. However, some languages, l...

admin

1.1k views

admin asked Aug 5, 2019

3 votes

0 answers

6794

Ullman (Compiler Design) Edition 2 Exercise 3.3 Question 1 (Page No. 125)
Consult the language reference manuals to determine the sets of characters that form the input alphabet (excluding those that may only appear in character strings or comments), the lexical form of numerical constants, and the lexical form of identifiers, for each of the following languages: C C++ C# Fortran Java Lisp SQL

Consult the language reference manuals to determinethe sets of characters that form the input alphabet (excluding those that may only appear in character strings or comme...

admin

1.1k views

admin asked Aug 5, 2019

0 votes

1 answer

6795

KPGCET-CSE-2019-1
The relational DBMS is constructed on relational principles which are based on The matrix theory Axiomatic principles Primary key Primary & foreign key relationship

The relational DBMS is constructed on relational principles which are based on The matrix theory Axiomatic principles Primary key Primary & foreign key relationship

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true