List questions from formal-grammar

Published on 22 Sep 2016 - 8:56

6.8k

Views

The context free grammar for language $L = \{a^nb^mc^k \mid k = |n - m|, n≥0,m≥0,k≥0\}$ is

Published on 11 Oct 2016 - 12:37

69

Views

This is a ll(1) of logic propositions?

Published on 22 Mar 2026 - 9:12

483

Views

Convert this CFG to Chomsky normal form.

Published on 29 Oct 2016 - 20:33

687

Views

Having some problems with Phrase Structure Grammar

Published on 29 Nov 2016 - 1:34

500

Views

Confirming an Answer for Phrase Structure Grammar

Published on 29 Nov 2016 - 3:50

62

Views

Quick question about grammars

Published on 30 Nov 2016 - 2:24

42

Views

What is the language of the following CFG?

Published on 04 Dec 2016 - 1:46

74

Views

What grammar accepts this language?

Published on 04 Dec 2016 - 1:58

156

Views

What is the FIRST and FOLLOW sets for this grammar...

Published on 14 Dec 2016 - 19:24

1k

Views

Given G a phrase structure grammar, what is the language generated by G?

Published on 21 Dec 2016 - 13:53

39

Views

Finding a context-sensitive grammar for L

Published on 10 Jan 2017 - 21:55

65

Views

A smallest grammar algorithm can recurse by decomposing into terminals, then repeating with increased alphabet.

Published on 04 Mar 2017 - 18:24

95

Views

Given a finite set of group generators (via a group action on a finite set of objects), can we enumerate the group easily?

Published on 05 Mar 2017 - 6:21

781

Views

A group action associated with a smallest grammar algorithm. Ways to reduce size?

Published on 05 Mar 2017 - 12:04

List Question

formal grammar from automaton

The context free grammar for language $L = \{a^nb^mc^k \mid k = |n - m|, n≥0,m≥0,k≥0\}$ is

This is a ll(1) of logic propositions?

Convert this CFG to Chomsky normal form.

Having some problems with Phrase Structure Grammar

Confirming an Answer for Phrase Structure Grammar

Quick question about grammars

What is the language of the following CFG?

What grammar accepts this language?

What is the FIRST and FOLLOW sets for this grammar...

Given G a phrase structure grammar, what is the language generated by G?

Finding a context-sensitive grammar for L

A smallest grammar algorithm can recurse by decomposing into terminals, then repeating with increased alphabet.

Given a finite set of group generators (via a group action on a finite set of objects), can we enumerate the group easily?

A group action associated with a smallest grammar algorithm. Ways to reduce size?

Trending Questions

Popular # Hahtags

Popular Questions