Request for comments on the following program: http://www.contrib.andrew.cmu.edu/~a...kshop/tokens.c
It's a token counter for the C programming language, following
the outline kind-of-described here: http://www.kochandreas.com/home/lang...sts/TOKENS.HTM
Basically, it's supposed to give a reasonable approximation of
the number of "atomic tokens" present in a C source file.
To those reading in c.l.c: Are there any glaring mistakes or
poor coding styles in the program itself? And did I miss any
corner cases --- does the program produce a wrong number of
tokens for any valid C99 program?
To those reading in c.l.m: Andreas, this is for you. (:
I'm just posting it generally in case anyone has any comments
along the lines of "gee, C is nifty!" or "gee, C can't do
anything!"
Please set follow-ups appropriately in your reply: comp.lang.c
probably doesn't care about Practical Language Comparison ;) and
comp.lang.misc definitely doesn't want long pedantic debates about
whether #define is one token or two.[1] ;)
-Arthur
[1] - I'm counting it as one token in my program, even though
it looks like technically it's not a "token" in any sense of the
word, Standard-ly speaking. 19 3223
In comp.lang.misc Arthur J. O'Dwyer <aj*@nospam.and rew.cmu.edu> wrote: comp.lang.misc definitely doesn't want long pedantic debates about whether #define is one token or two.[1] ;)
Why not? They /are/ two tokens:
# define x y
Nils
--
Nils M Holm <nm*@despammed. com> -- http://www.t3x.org/nmh/
I'm reading this in comp.lang.c, followup set.
"Arthur J. O'Dwyer" <aj*@nospam.and rew.cmu.edu> writes: Request for comments on the following program: http://www.contrib.andrew.cmu.edu/~a...kshop/tokens.c
It's a token counter for the C programming language, following the outline kind-of-described here: http://www.kochandreas.com/home/lang...sts/TOKENS.HTM Basically, it's supposed to give a reasonable approximation of the number of "atomic tokens" present in a C source file.
To those reading in c.l.c: Are there any glaring mistakes or poor coding styles in the program itself? And did I miss any corner cases --- does the program produce a wrong number of tokens for any valid C99 program?
I have just quickly skimmed your code, so please take my comments with a
grain of salt.
I prefer `int main (void)' over `int main ()', especially since you
don't use pre-C89-style definitions for all other functions.
When `getchar ()' returns `EOF', you should check if this is due to an
error or due to end-of-file condition.
The goal is apparently to count preprocessing-tokens, right? In that
case, you seem to parse numbers on a too detailed level. Preprocessing-
numbers are defined in much more general terms, see 6.4.8 (of the C99
standard) for details.
Martin
--
,--. Martin Dickopp, Dresden, Germany ,= ,-_-. =.
/ ,- ) http://www.zero-based.org/ ((_/)o o(\_))
\ `-' `-'(. .)`-'
`-. Debian, a variant of the GNU operating system. \_/
Arthur J. O'Dwyer wrote: Request for comments on the following program: http://www.contrib.andrew.cmu.edu/~a...kshop/tokens.c
[...] To those reading in c.l.c: Are there any glaring mistakes or poor coding styles in the program itself? And did I miss any corner cases --- does the program produce a wrong number of tokens for any valid C99 program?
It doesn't handle digraphs correctly: the following produces an error:
int main()<%%>
I think the task isn't well defined for a language with several
translation phases, like C, however. You have to decide whether to
count tokens or preprocessing tokens. In order to count tokens you
either need to specify that the input is already preprocessed, or
implement most of a preprocessor yourself. The following program has
35 preprocessing tokens, but only 11 tokens:
#define str(x) # x
int main() { puts(
str(
int main() { puts
("Hello, world.");
return 0;
}));}
Your program gives "34" for this (counting "#define" as a single
token), so it seems to be counting preprocessing tokens. However,
some valid preprocessing tokens, such as certain preprocessing
numbers, are rejected:
#define str(x) # x
int main() { str(3p+); }
I think all the programs above are strictly conforming.
comp.lang.misc definitely doesn't want long pedantic debates about whether #define is one token or two.[1] ;)
[...] [1] - I'm counting it as one token in my program, even though it looks like technically it's not a "token" in any sense of the word, Standard-ly speaking.
"#" is a punctuator, which is a token, and "define" is an identifier,
also a token.
Jeremy.
Nils M Holm <nm*@despammed. com> writes: In comp.lang.misc Arthur J. O'Dwyer <aj*@nospam.and rew.cmu.edu> wrote: comp.lang.misc definitely doesn't want long pedantic debates about whether #define is one token or two.[1] ;)
Since this posting might be the start of a long pedantic debate ;) about
`#define' being two tokens, I ignored the Followup-To: comp.lang.misc,
and set a Followup-To: comp.lang.c.
Why not? They /are/ two tokens:
# define x y
<pedantic>
While you're right, the fact that spaces are allowed between `#' and
`define' doesn't prove anything. ;) The language /could/ have defined
the sequence of `#', spaces, and `define' as a single preprocessing-
token. String literals are an example of preprocessing-tokens which may
include spaces.
</pedantic>
Martin
--
,--. Martin Dickopp, Dresden, Germany ,= ,-_-. =.
/ ,- ) http://www.zero-based.org/ ((_/)o o(\_))
\ `-' `-'(. .)`-'
`-. Debian, a variant of the GNU operating system. \_/
Combined response to Martin's and Jeremy's replies.
Thanks (so far...)!
On Fri, 30 Apr 2004, Arthur J. O'Dwyer wrote: Request for comments on the following program: http://www.contrib.andrew.cmu.edu/~a...kshop/tokens.c
Things I fixed:
int main(void) replaces int main(). Style issue.
Comments inside string and character literals weren't being handled.
Fixed now.
I had forgotten digraphs entirely. Fixed now.
Comments add spaces; e.g., makes a/**/b two tokens instead of one.
"# define" et al. are now two tokens instead of one. Jeremy's
argument convinced me, I guess. :) The fact that you can stick a
comment in between the "#" and the "define" contributed to my conviction,
too, although I knew that before.
Unrecognized or probably-invalid symbols are passed through anyway,
thus doing away with the NULL return from 'mystate'. This is to deal
with problems involving stringizing macros: basically *anything* could
be passed to them!
Martin Dickopp wrote: The goal is apparently to count preprocessing-tokens, right? In that case, you seem to parse numbers on a too detailed level. Preprocessing- numbers are defined in much more general terms, see 6.4.8 (of the C99 standard) for details.
It seems at a quick glance that the pp-number definition would
make
0xDE+0xAD
into one token, where a more comprehensive approach would suggest it's
"really" three tokens --- 0xDE, +, and 0xAD. So while I agree I'm
doing too much with numbers, I don't yet see a better way that jibes
with the way I'm trying to define "tokens."
Jeremy Yallop wrote: I think the task isn't well defined for a language with several translation phases, like C, however. You have to decide whether to count tokens or preprocessing tokens.
Right. At least, I have to make up a definition of "token"
that makes sense for most applications. Post-preprocessing tokens
are too complicated to handle on this program's scale; and you
pointed out the "stringizin g" issue, which I hadn't considered before
either.
Well, new version uploaded; same request for comments on this one. :)
Particularly, I'm not entirely sure that all numbers are handled
appropriately; and I'm not entirely sure that I did the digraph stuff
right --- especially 'PercentOp', which has to discriminate between
%, %:, %=, %>, and %:%:. FSMs are hard. ;-)
-Arthur
In comp.lang.misc Martin Dickopp <ex************ ****@zero-based.org> wrote: While you're right, the fact that spaces are allowed between `#' and `define' doesn't prove anything. ;) The language /could/ have defined the sequence of `#', spaces, and `define' as a single preprocessing- token.
While you are right, let's apply occam's razor: what is more likely,
that the parts of /some/ specific tokens can be separated by
(otherwise useless) spaces or that these space separate individual
tokens? :-)
String literals are an example of preprocessing-tokens which may include spaces.
True. However, these spaces do have a purpose.
Nils
--
Nils M Holm <nm*@despammed. com> -- http://www.t3x.org/nmh/
"Arthur J. O'Dwyer" wrote:
.... snip ... Please set follow-ups appropriately in your reply: comp.lang.c probably doesn't care about Practical Language Comparison ;) and comp.lang.misc definitely doesn't want long pedantic debates about whether #define is one token or two.[1] ;)
[1] - I'm counting it as one token in my program, even though it looks like technically it's not a "token" in any sense of the word, Standard-ly speaking.
I suggest you could have better set follow-ups yourself. How does
your code handle:
# if whatever
# define blah
# else
# undefine foo
# endif
which is perfectly legal, and necessary for some older compilers.
--
Chuck F (cb********@yah oo.com) (cb********@wor ldnet.att.net)
Available for consulting/temporary embedded and systems.
<http://cbfalconer.home .att.net> USE worldnet address!
"Arthur J. O'Dwyer" <aj*@nospam.and rew.cmu.edu> writes: Martin Dickopp wrote: The goal is apparently to count preprocessing-tokens, right? In that case, you seem to parse numbers on a too detailed level. Preprocessing- numbers are defined in much more general terms, see 6.4.8 (of the C99 standard) for details. It seems at a quick glance that the pp-number definition would make 0xDE+0xAD into one token,
Yes, it's one pp-token.
where a more comprehensive approach would suggest it's "really" three tokens --- 0xDE, +, and 0xAD.
It's a pp-token which cannot be converted to a token. Compare the
following two programs (difference underlined):
#include <stdio.h>
int main (void) { printf ("%d\n", 0xDE + 0xAD); return 0; }
/* ^^^^^^^^^^^ */
and
#include <stdio.h>
int main (void) { printf ("%d\n", 0xDE+0xAD); return 0; }
/* ^^^^^^^^^ */
The first one displays the number 395. The second one violates the
constraint of 6.4#2, so the implementation is free to interpret it in
any way it likes (after issuing at least one diagnostic).
Martin
PS: C specific discussion, therefore Followup-To: comp.lang.c.
--
,--. Martin Dickopp, Dresden, Germany ,= ,-_-. =.
/ ,- ) http://www.zero-based.org/ ((_/)o o(\_))
\ `-' `-'(. .)`-'
`-. Debian, a variant of the GNU operating system. \_/
Nils M Holm <nm*@despammed. com> writes: In comp.lang.misc Martin Dickopp <ex************ ****@zero-based.org> wrote: While you're right, the fact that spaces are allowed between `#' and `define' doesn't prove anything. ;) The language /could/ have defined the sequence of `#', spaces, and `define' as a single preprocessing- token.
While you are right, let's apply occam's razor: what is more likely, that the parts of /some/ specific tokens can be separated by (otherwise useless) spaces or that these space separate individual tokens? :-)
There's not even a need to apply Occam's razor, since this aspect of the
C language is precisely defined: The likelihoods of the variants are
exactly 0 and 1, respectively. :)
Of course, I agree with your point: Defining the language such that the
sequence of `#', spaces, and `define' are a single token would have been
utterly stupid.
Martin
--
,--. Martin Dickopp, Dresden, Germany ,= ,-_-. =.
/ ,- ) http://www.zero-based.org/ ((_/)o o(\_))
\ `-' `-'(. .)`-'
`-. Debian, a variant of the GNU operating system. \_/ This thread has been closed and replies have been disabled. Please start a new discussion. Similar topics |
by: Jeff Relf |
last post by:
Hi All,
I plan on using the following C++ code
to create nodes with unlimited children:
// I would like to declare NodeT like this,
// but it won't compile because Lnk_T is not defined yet.
struct NodeT { Lnk_T Lnk ; };
|
by: cr88192 |
last post by:
for various reasons, I added an imo ugly hack to my xml parser.
basically, I wanted the ability to have binary payload within the xml parse
trees.
this was partly because I came up with a binary xml format (mentioned more
later), and thought it would be "useful" to be able to store binary data
inline with this format, and still wanted to keep things balanced (whatever
the binary version can do, the textual version can do as well).
the...
|
by: Andy Leszczynski |
last post by:
Why email/Encoders.py is missing binary encoding. It should be there
according to RFC 1521:
encoding := "Content-Transfer-Encoding" ":" mechanism
mechanism := "7bit" ; case-insensitive
/ "quoted-printable"
/ "base64"
/ "8bit"
/ "binary"
/ x-token
|
by: Simon Morgan |
last post by:
I'm trying to write a function to parse a Reverse Polish Notation string
from stdin and return 1 token at a time. For those of you who are unaware
an RPN string looks like this:
1 2 + 4 * 3 +
With each number being read and pushed onto a stack and, when an operator
is encountered, each number on the stack is popped off and calculated
using that operator and the result pushed onto the stack.
|
by: Dan |
last post by:
Hi,
I'm trying to call an RFC from a vb web service. I have created the
proxy object with no worries but the return table always returns an
error even when I get success running the RFC inside SAP. I login to
the GUI under my own username but all the rfcs go through one rfc
user.
Before I go to the authorisations people, does this sounds like a
permissions problem at the SAP end or has anyone else experienced
problems like these? I...
| |
by: Jay C. |
last post by:
Jay
3 Jan. 11:38 Optionen anzeigen
Newsgroups: microsoft.public.dotnet.framework.webservices.enhancements
Von: "Jay" <p.brunm...@nusurf.at> - Nachrichten dieses Autors suchen
Datum: 3 Jan 2006 02:38:30 -0800
Lokal: Di 3 Jan. 2006 11:38
Betreff: Referenced security token could not be retrieved
Antworten | Antwort an Autor | Weiterleiten | Drucken | Einzelne Nachricht |
Original anzeigen | Entfernen | Missbrauch melden
|
by: Manuel |
last post by:
I'm trying to compile glut 3.7.6 (dowbloaded from official site)using
devc++.
So I've imported the glut32.dsp into devc++, included manually some
headers, and start to compile.
It return a very strange error. In your experience, where I should
looking to find the real error? Surely the sintax of glut is correct...
gcc.exe -c glut_bitmap.c -o glut_bitmap.o -I"C:/Dev-Cpp/include"
-I"../../include" -D__GNUWIN32__ -W -DWIN32 -DNDEBUG...
|
by: Joriveek |
last post by:
Hi,
I have a little piece of program here
Basically what it does is, it copies the strings of variable widths. The
basis is until it finds a comma ",". The input is a CSV/Comma Separated
file.
Now the problem is that it is not counting Spaces. For example to read the
following line with the below Program is OK:
|
by: jacob navia |
last post by:
Hi
Reading comp.std.c I noticed that there was a message like this:
The WG14 Post Portland mailing is now available from the WG14 web site
at http://www.open-std.org/jtc1/sc22/wg14/
Best regards
Keld Simonsen
|
by: Hystou |
last post by:
Most computers default to English, but sometimes we require a different language, especially when relocating. Forgot to request a specific language before your computer shipped? No problem! You can effortlessly switch the default language on Windows 10 without reinstalling. I'll walk you through it.
First, let's disable language synchronization. With a Microsoft account, language settings sync across devices. To prevent any complications,...
|
by: Oralloy |
last post by:
Hello folks,
I am unable to find appropriate documentation on the type promotion of bit-fields when using the generalised comparison operator "<=>".
The problem is that using the GNU compilers, it seems that the internal comparison operator "<=>" tries to promote arguments from unsigned to signed.
This is as boiled down as I can make it.
Here is my compilation command:
g++-12 -std=c++20 -Wnarrowing bit_field.cpp
Here is the code in...
| |
by: jinu1996 |
last post by:
In today's digital age, having a compelling online presence is paramount for businesses aiming to thrive in a competitive landscape. At the heart of this digital strategy lies an intricately woven tapestry of website design and digital marketing. It's not merely about having a website; it's about crafting an immersive digital experience that captivates audiences and drives business growth.
The Art of Business Website Design
Your website is...
|
by: Hystou |
last post by:
Overview:
Windows 11 and 10 have less user interface control over operating system update behaviour than previous versions of Windows. In Windows 11 and 10, there is no way to turn off the Windows Update option using the Control Panel or Settings app; it automatically checks for updates and installs any it finds, whether you like it or not. For most users, this new feature is actually very convenient. If you want to control the update process,...
|
by: tracyyun |
last post by:
Dear forum friends,
With the development of smart home technology, a variety of wireless communication protocols have appeared on the market, such as Zigbee, Z-Wave, Wi-Fi, Bluetooth, etc. Each protocol has its own unique characteristics and advantages, but as a user who is planning to build a smart home system, I am a bit confused by the choice of these technologies. I'm particularly interested in Zigbee because I've heard it does some...
|
by: isladogs |
last post by:
The next Access Europe User Group meeting will be on Wednesday 1 May 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM).
In this session, we are pleased to welcome a new presenter, Adolph Dupré who will be discussing some powerful techniques for using class modules.
He will explain when you may want to use classes instead of User Defined Types (UDT). For example, to manage the data in unbound forms.
Adolph will...
|
by: conductexam |
last post by:
I have .net C# application in which I am extracting data from word file and save it in database particularly. To store word all data as it is I am converting the whole word file firstly in HTML and then checking html paragraph one by one.
At the time of converting from word file to html my equations which are in the word document file was convert into image.
Globals.ThisAddIn.Application.ActiveDocument.Select();...
|
by: TSSRALBI |
last post by:
Hello
I'm a network technician in training and I need your help.
I am currently learning how to create and manage the different types of VPNs and I have a question about LAN-to-LAN VPNs.
The last exercise I practiced was to create a LAN-to-LAN VPN between two Pfsense firewalls, by using IPSEC protocols.
I succeeded, with both firewalls in the same network. But I'm wondering if it's possible to do the same thing, with 2 Pfsense firewalls...
| |
by: bsmnconsultancy |
last post by:
In today's digital era, a well-designed website is crucial for businesses looking to succeed. Whether you're a small business owner or a large corporation in Toronto, having a strong online presence can significantly impact your brand's success. BSMN Consultancy, a leader in Website Development in Toronto offers valuable insights into creating effective websites that not only look great but also perform exceptionally well. In this comprehensive...
| |