Try to answer in terms of C language.
200500
Are there languages which allow a keyword to be\naccepted as an identifier.\n\nYes, most of the old (incomprehensible) languages did that (like PL/1) i think but i'm not sure, i'm not very used to obsolete languages)....\n\nAh, so modern languages like C are "comprehensible"? Perhaps you should spend some time looking at the submissions to the Obfuscated C contests.\n\nEveryone loves to give PL/I examples like:\n\nIF IF = THEN THEN THEN = ELSE ELSE ELSE = END END\n\n[Actually IF IF = THEN THEN = ELSE; ELSE ELSE = END; END -John]\n\n(which I think is valid PL/I - it's been years, but it's at least close) but that simply proves that you *can* write incomprehensible code in PL/I. So? Show me a language in which you *can't* write incomprehen-sible code.\n\nWhat gets forgotten in all this is the *reason* PL/I didn't reserve its keywords. The PL/I designers knew they were designing what was, for its time, a very large language, which was intended to be useful to very different groups of programmers. History lesson: PL/I and the 360 series were developed at the same time. Originally, PL/I was intended\nto be *the* programming language for the 360. Before the 360, IBM and others in the business had two lines of machines, one for business (for IBM, the 1400 series), one for scientific work (the 709x). Business machines often did decimal arithmetic, had instructions for string manipulation, BCD support, and such, and were programmed in languages like COBOL. Scientific machines usually used binary arithmetic, supported floating point, and were programmed in languages like FORTRAN (US) and Algol (Europe). One fundamental idea in the development 360\nwas to have one line of machines to serve both markets. PL/I was similarly intended to replace both COBOL and PL/I. One of the great comments of the era was that a committee of COBOL and FORTRAN experts sat down to design PL/I - and came up with a language that looked more like Algol than either. \n\nSince PL/I was large and served disparate markets, it was likely that most programmers would only be familiar with a subset of the language. Experience with COBOL - which had a long list of keywords, all reserved  - showed that avoiding all the keywords was a headache. It would be even more so if you had to avoid keywords that only applied to parts of\nthe language you didn't know. So the PL/I designers made the deliberate decision to avoid reserved keywords. Rather than criticizing as incomprehensible a language you know nothing about, take a look at it and find places where the language was made ugly or artificial to avoid reserving keywords. I'll bet you have a lot of trouble doing so.\n\nLest you think that long lists of (reserved) keywords is a feature only of obsolete languages, I suggest you look at the list for C++. I believe C++ reserves more keywords than PL/I had - and perhaps as many as COBOL at its worst did. (Certainly, modern C++ is a larger language the PL/I ever was.)\n\nOver the years, another cost of reserved keywords has become apparent: It becomes difficult to extend the language. You're faced with the Hobson's choice of adding a new readable keyword, thus breaking existing correct code; adding an unreadable keyword that's unlikely to conflict\nwith existing code; or reusing some existing keyword for a new purpose. There's often a bias toward the last of these -and you can see the results in languages like C and C++, where keywords like static and virtual have a variety of only very loosely related meanings.\n\nI suspect the main reason people have generally reserved keywords is two-fold: Language "style" has become fixed, and people want to use lexers and parser generators. Language "style" is hard to pin down, but it's clear that, whatever C "style" is, it's been a big winner - C and\nJava both have C "style". However, C "style" isn't compatible with non- r
258132
I'm no "C" expert, but in Delphi this is a Windows system call, and I'm sure it will be a similar implementation in C; just alter the syntax as necessary...
176644
a programmer wont waste his/her time here!\nso there is no one to answer you ;)
620821
That would be C.  \n\nThese links should help you understand this question.
335048
question 1-b\nquestion 2-c
411380
From what I have been able to find out, the answer may be C.
279479
if you plan to get into the embedded world, then yes, I would do a little studying in C. Embedded apps. mostly use C as the prefered language. Knowing C++ well, means you already know C, but there are a few differences you would want to learn. I suggest just get a book on C and maybe do a few C apps, and you will have it, add "proficient in C" to resume.
2251
i dont know in what environment you work, but a C++ program would look like this:\n#include<iostream.h>\nint n,a[10][10],i,j;\nvoid main()\n{cin>>n;\n for (i=0;i<n;i++)\n   for (j=0;j<n;j++)\n      {\n       cin>>a[i][j];\n       if (a[i][j]==0) cout<<i<<" "<<j<<"&#92;n";\n      }\n}
673593
C (but my Sociology professor always said that if C seems wrong then the longest answer is usually the best guess)
346327
Dude !\nFirst you gotta learn how to ask the question !!\nNo one can answer the question in it's current form...\nAT LEAST give the details our Byte guy asked for...
174180
1. C\n2. C\n\nRule of thumb:  if you don't know the answer, choose C.
37830
i believe c is the answer - not 100%
545700
could cause programs to look in the wrong place for things. change it to c
155418
#include <ctype.h>\n#include <stdio.h>\n#include <stdlib.h>\n\nstatic char *article[] = { "the","a", "one", "some", "any" };\nstatic char *noun   [] = { "boy","girl", "dog", "town", "car" };\nstatic char *verb   [] = { "drove","jumped", "ran", "walked", "skipped" };\nstatic char *prep   [] = { "to", "from", "over", "under", "on" };\n\nint\nmain()\n{\n  int asize = sizeof(article)/sizeof(article[0]);\n  int nsize = sizeof(noun)/sizeof(noun[0]);\n  int vsize = sizeof(verb)/sizeof(verb[0]);\n  int psize = sizeof(prep)/sizeof(prep[0]);\n\n  char buff[100];\n  for (int i=0; i<20; i++) {\n    (void)sprintf(buff, "%s %s %s %s %s %s.",\n      article[rand()%asize],\n      noun[rand()%nsize],\n      verb[rand()%vsize],\n      prep[rand()%psize],\n      article[rand()%asize],\n      noun[rand()%nsize]);\n    *buff = toupper(*buff);\n    (void)printf("%s&#92;n", buff);\n  }\n  return 0;\n}\n\n\n$ a.out\nSome town walked to a dog.\nThe car ran from any dog.\nAny boy drove under any town.\nOne girl jumped under the girl.\nOne car jumped to one girl.\nAny boy skipped over a dog.\nAny town jumped from some town.\nThe town ran from the town.\nOne car walked to any town.\nOne town ran over one boy.\nAny town jumped on the car.\nSome dog skipped from a boy.\nSome girl skipped over a boy.\nA car walked over some girl.\nThe car jumped from a girl.\nThe boy skipped on the town.\nAny car walked from one girl.\nAny dog ran to a town.\nA car jumped under some car.\nSome boy walked to the car.
62710
C solution:\n\nint nr[20];\nint valid=1,i,j;\nint main(int argc, char **argv){\nfor (i=0;(i<20)&&(valid);i++){\n scanf("%d",&nr[i]);\n if (nr[i]<10)||(nr[i]>100){\n  printf("Invalid number");\n  valid=0;\n }\n for (j=0;j<i;j++)\n  if (nr[j]==nr[i]){\n    printf("Duplicate number");\n    valid=0;\n  }\n}\n}
147118
#include <stdio.h>\n\nint main (void)\n{\nint i, j;\n\nfor (i = 5; i > 0; i--)\n{\nfor (j = i; j > 0; j--)\nprintf ("*");\n\nprintf ("&#92;n");\n}\n\nreturn 0;\n}\n_____\n\n#include <stdio.h>\n\nint main (void)\n{\nint i, j;\n\nfor (i = 1; i <= 5; i++)\n{\nfor (j = 1; j <= i; j++)\nprintf ("%d ", i);\n\nprintf ("&#92;n");\n}\n\nreturn 0;\n}
647050
Got the answer yet? (f11)