Consider the language defined by the following BNF grammar. Describe in plain English what its sentences...

Transcribed Image Text:

Consider the language defined by the following BNF grammar. Describe in plain English what its sentences consist of. Write the equivalent EBNF. Write a regular expression that will match such sentences. (3 marks) -> <A> b | <A> b <C> a | a <A> c | <C> c (b) The syntax of the standard format specifier in Python is defined by the following EBNF. Write accordingly a regular expression that will match any valid format string, such as '<8', '*10', '+6', '15, .2', etc. (3 marks) <spec> -> [[<fill>] <align>] [<sign>] [<width>] [₁] [.<prec>] <fill> <character> ( i.e., any one character ") <align> >< | > | = | A <sign> >+|-|!! <width> -> <integer> (* i.e., one or more digits 0..9 ") <prec> -> <integer> Consider the language defined by the following BNF grammar. Describe in plain English what its sentences consist of. Write the equivalent EBNF. Write a regular expression that will match such sentences. (3 marks) -> <A> b | <A> b <C> a | a <A> c | <C> c (b) The syntax of the standard format specifier in Python is defined by the following EBNF. Write accordingly a regular expression that will match any valid format string, such as '<8', '*10', '+6', '15, .2', etc. (3 marks) <spec> -> [[<fill>] <align>] [<sign>] [<width>] [₁] [.<prec>] <fill> <character> ( i.e., any one character ") <align> >< | > | = | A <sign> >+|-|!! <width> -> <integer> (* i.e., one or more digits 0..9 ") <prec> -> <integer>