Register

NIELIT 2021 Dec Scientist A - Section B: 67

• recategorized by
532 views

1 Answer

0 0 votes

Context sensitive ….

 

Context-sensitive is most general phase-structured grammar....

A context-sensitive grammar (CSG) is a formal grammar in which the left-hand sides and right-hand sides of any production rules may be surrounded by a context of terminal and nonterminal symbols….

A context-sensitive user interface is one which can automatically choose from a multiplicity of options based on the current or previous state of the program operation...

Context sensitivity is almost ubiquitous in current graphical user interfaces, usually in the form of context menus….

 

 

Voting & Accepting an answer helps improve the community
Answer:
← Previous · NIELIT 2021 Dec Scie...Next → · NIELIT 2021 Dec Scie...
← Previous in category · NIELIT 2021 Dec Scie...Next in category → · NIELIT 2021 Dec Scie...
Position:
Show:

Related questions

0 0 votes
1 1 answer
524
524 views
soujanyareddy13 asked Jan 9, 2022
524 views
NIELIT 2021 Dec Scientist A - Section B: 92
Consider the grammar with nonterminals $\text{N = \{ S, C, S}_{1} \}$ terminals $\text{T = \{ a, b, i, t, e \}}$ With $\text{S}$ as the start symbol, and the following se...
0 0 votes
1 1 answer
399
399 views
soujanyareddy13 asked Jan 9, 2022
399 views
NIELIT 2021 Dec Scientist A - Section B: 74
Assume that $\text{P}$ and $\text{NP}$ are different i.e. $\text{P! = NP}$ then for the expression $\text{NP-Complete} \cap \text{P} = ?$ Which among the following is cor...
0 0 votes
1 1 answer
583
583 views
soujanyareddy13 asked Jan 9, 2022
583 views
NIELIT 2021 Dec Scientist A - Section B: 91
If $\text{T1}$ and $\text{T2}$ are two Turing machines. The composite can be represented using the expression :$\text{T1T2}$$\text{T1} \cup \text{T2}$$\text{T1} \times \t...
0 0 votes
1 1 answer
497
497 views
soujanyareddy13 asked Jan 9, 2022
497 views
NIELIT 2021 Dec Scientist A - Section B: 98
Which of the following problems is undecidable ?Membership problem for $\text{CFGs}.$Ambiguity problem for $\text{CFGs}.$Finiteness problem for $\text{FSAs}.$Equivalence ...