Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following can generate Unrestricted grammars?

Which of the following can generate Unrestricted grammars? Correct Answer Pentonnen Normal form

Pentonnen Normal form(for Unrestricted grammars) is a special case where there is a slight modification in the format of Kuroda Normal form. AB->AD A->BC A->a

Related Questions

A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, int a[10] [3] ; The grammars use D as the start symbol, and use six terminal symbols int; id[ ] num Grammar G1 Grammar G2 D → int L; D → int L; L → id[E L → idE E → num] E → E[num] E → num][E E → [num]   Which of the grammars correctly generate the declaration mentioned above?
The following sentences form a paragraph. The first and the last sentences of the paragraph are given. The rest of the sentences are numbered as P, Q, R and S. These four parts are not given in their proper order. Read the sentences and choose the alternative that arranges them in the correct order. 1. The concept of Globalisation by integrating nation states within the theme work of World Trade Organisation (WTO) is an alternative version of the Theory of Comparative Cost Advantage propagated by the classical economists for assuming unrestricted flow of goods between the countries for mutual benefit, especially from Great Britain to other less developed countries or to their colonies. P. However, the advocates of globalisation, especially from the developed countries purposely limit the definition of globalisation to only three components, i.e., unrestricted trade flows, capital flows and technology flows. Q. They do not want to include the free flow labour within the parameter of globalisation set by them. R. In this way, the imperialist nations gained much at the cost of the colonial countries who had to suffer from the scar of stagnation and poverty. S. The World Commission on the Social Dimension of Globalisation (WCSDG) set up by ILO has also made some important observations on globalisation. 6. In the meantime, various countries of the world have adopted the policy of globalisation.
Consider the following problems. L(?) denotes the language generated by a grammar ?. L(?) denotes the language accepted by a machine ?. (I) For an unrestricted grammar ? and a string ?, whether ? ∈ (?) (II) Given a Turing machine M, whether L(M) is regular (III) Given two grammars ?1 and ?2, whether (?1) = (?2) (IV) Given an NFA N, whether there is a deterministic PDA P such that N and P accept the same language. Which one of the following statements is correct?
Which of the following statement(s) is/are CORRECT? I. Acids are sour in taste and generate H+ ions. II. Acids are sour in taste and generate OH- ions. III. Bases are bitter in taste and generate OH- ions.
Which of the following statement(s) is/are CORRECT? I. Acids are sour in taste and generate H+ ions. II. Acids are sour in taste and generate OH– ions. III. Bases are bitter intaste and generate OH– ions.
Which of the following problems are decidable? I. Checking whether two regular languages are equivalent languages II. Checking whether two non-deterministic finite automata accept the same language III. Checking whether two context free grammars generate equivalent languages  IV. Checking whether a language of a context free grammar is non-empty
Assume the statements S1 and S2 given as: S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite. S2: There exists an algorithm to determine whether two context free grammars generate the same language. Which of the following is true?
Regular Grammars generate Regular Languages.
Unrestricted execution policy can be set up in SQL Server can be done using __________
If x is a decision variable of LPP and unrestricted in sign then this variable can be converted into x = x’ – x’’ so as to solve the LPP by simplex method, where: