Question

21. pts) Given the BNF Grammar ( 5) ID Show a single combined grammar (belo assume ID is just any arbitrary sequence mar (below) with all of the following additions/modifications. TO any arbitrary sequence of characters or digits, ands is the start and S is the "start" symbol. 1) Archi-cassociative binary-operator '@' of lower precedence ower precedence than the exiting + operator. - Add a ler-sociative binary-operator '#' such that its precedence lever existing '*' operator but lesser than the existing '()' operator. precedence level is greater than the

Answer 1

1) pys@pls 545+21 @ Q7 Qxflr 77(P) | 10 2) Ś > stala Q-> Q*V IV v -> V#rir 18 (5) ID