List questions from formal-grammar

Published on 12 Feb 2015 - 20:05

96

Views

$L_{a}= \{w_{1}cw_{2} : w_{1},w_{2} \in \{a,b\}^{\ast}, w_{1} = w_{2}\}$

Published on 25 Feb 2015 - 11:12

196

Views

Languages and their relation : help

Published on 02 Apr 2015 - 18:05

154

Views

Is it possible to write an Unambiguous Grammar for Two Hard Language?

Published on 14 Apr 2015 - 19:09

91

Views

Context free grammar and regular expressions

Published on 15 Apr 2015 - 4:51

344

Views

How to show $L = \{a^n b^m c^p: n\neq m\} \cup \{a^n b^m c^p: m\neq p\}$ is ambiguous?

Published on 15 Apr 2015 - 11:27

74

Views

Write grammar for given language

Published on 22 Apr 2015 - 7:39

88

Views

Is this language context-free or not?

Published on 23 Apr 2015 - 2:31

758

Views

Formal writing in math: equations

Published on 07 May 2015 - 13:35

81

Views

Wrong proposition in "Atiyah and Macdonald"s book?!

Published on 24 May 2015 - 12:39

108

Views

Context-free language or not

Published on 24 May 2015 - 14:52

188

Views

Construct grammar $\ a^i b^j c^{i+j} b^j a^i $

Published on 20 Jun 2015 - 20:23

66

Views

Inquiry into operator precedence grammar

Published on 11 Sep 2015 - 7:38

788

Views

CFG for the language $L = \{(a^n)(b^m)(c^k) \mid k = |n – m|, n,m,k \geqslant 0\}$

Published on 16 Sep 2015 - 10:21

1.7k

Views

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production

Published on 28 Sep 2015 - 13:24

List Question

Context Free Grammar and some details

$L_{a}= \{w_{1}cw_{2} : w_{1},w_{2} \in \{a,b\}^{\ast}, w_{1} = w_{2}\}$

Languages and their relation : help

Is it possible to write an Unambiguous Grammar for Two Hard Language?

Context free grammar and regular expressions

How to show $L = \{a^n b^m c^p: n\neq m\} \cup \{a^n b^m c^p: m\neq p\}$ is ambiguous?

Write grammar for given language

Is this language context-free or not?

Formal writing in math: equations

Wrong proposition in "Atiyah and Macdonald"s book?!

Context-free language or not

Construct grammar $\ a^i b^j c^{i+j} b^j a^i $

Inquiry into operator precedence grammar

CFG for the language $L = \{(a^n)(b^m)(c^k) \mid k = |n – m|, n,m,k \geqslant 0\}$

What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon and unit-production

Trending Questions

Popular # Hahtags

Popular Questions