Register

CFL Gate 1987

1,963 views

1 Answer

4 votes
4 votes
Context Free Grammars (CFGs) are used to represent syntax of a programming language. So, by using CFGs, syntax representation is possible but semantics representation isn't possible. In any programming language(C, C++, Java), Context Sensitive Grammars (CSGs) are used to represent semantic rules. Hence, those programming languages which require semantic rule representation are called as Context Sensitive Languages (CSLs).

Therefore, C is a Context Sensitive Language.

Note- FORTRAN is Context Free Language (CFL)
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

22 votes
22 votes
6 answers
1
makhdoom ghaya asked Nov 14, 2016
5,454 views
GATE CSE 1987 | Question: 10d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper non-null substrings of the string $0110$.
User Avatar
14 votes
14 votes
2 answers
2
makhdoom ghaya asked Nov 9, 2016
3,936 views
GATE CSE 1987 | Question: 2m
State whether the following statements are TRUE or FALSE: The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
State whether the following statements are TRUE or FALSE:The problem as to whether a Turing machine $M$ accepts input $w$ is undecidable.
User Avatar
14 votes
14 votes
4 answers
3
makhdoom ghaya asked Nov 9, 2016
3,551 views
GATE CSE 1987 | Question: 2l
State whether the following statement are TRUE or FALSE. $A$ is recursive if both $A$ and its complement are accepted by Turing machines.
State whether the following statement are TRUE or FALSE.$A$ is recursive if both $A$ and its complement are accepted by Turing machines.
User Avatar
21 votes
21 votes
4 answers
4
makhdoom ghaya asked Nov 9, 2016
3,356 views
GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.
User Avatar
Link Copied!