search
Log In
0 votes
264 views

Consult the language reference manuals to determine

  1. the sets of characters that form the input alphabet (excluding those that may only appear in character strings or comments),
  2. the lexical form of numerical constants, and
  3. the lexical form of identifiers, for each of the following languages:  

 

  1.  C
  2. C++
  3. C#
  4. Fortran
  5. Java
  6. Lisp
  7. SQL
in Compiler Design
retagged by
264 views

Please log in or register to answer this question.

Related questions

0 votes
0 answers
1
291 views
Tagged languages like HTML or XML are different from conventional programming languages in that the punctuation (tags) are either very numerous (as in HTML) or a user-definable set (as in XML). Further, tags can often have parameters. Suggest how to divide the ... you liked that one. <P> into appropriate lexemes. Which lexemes should get associated lexical values,and what should those values be?
asked Jul 27, 2019 in Compiler Design Lakshman Patel RJIT 291 views
0 votes
0 answers
2
303 views
Divide the following C + + program: float limitedSquare(x) float x { /* returns x-squared, but never more than 100 */ return (x<=-10.0 || x>=10.0)?100:x*x; } into appropriate lexemes, using the discussion of Section $3.1.2$ as a guide. Which lexemes should get associated lexical values? What should those values be?
asked Jul 27, 2019 in Compiler Design Lakshman Patel RJIT 303 views
0 votes
0 answers
3
557 views
Write regular definitions for the following languages: All strings of lowercase letters that contain the five vowels in order. All strings of lowercase letters in which the letters are in ascending lexicographic order. Comments, consisting of a string surrounded by /* and */, without ... 's that do not contain the substring abb. All strings of a's and b's that do not contain the subsequence abb.
asked Aug 5, 2019 in Compiler Design Lakshman Patel RJIT 557 views
0 votes
0 answers
4
326 views
Most languages are case sensitive, so keywords can be written only one way, and the regular expressions describing their lexeme is very simple. However, some languages, like SQL, are case insensitive, so a keyword can be written either in lowercase or in ... regular expression for a keyword in a case-insensitive language. Illustrate the idea by writing the expression for "select" in SQL.
asked Aug 5, 2019 in Compiler Design Lakshman Patel RJIT 326 views
...