473,385 Members | 1,769 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,385 software developers and data experts.

Best lex/yacc for C++?

Hi,

I am searching for the best lex and yacc combination (or something similar)
that can be used in combination with C++ and that can contain C++ code. I
have the regular flex/bison port working but then I, of course, can't use
C++ constructs in the actions.

I have tried spirit although I could make a simple command line parser
(after too many hours), creating a parser tree with it was not possible in
an easy way (the compiler choked while compiling the include files), so back
to a lex/yacc clone I guess.

Does anyone have any opinion (especially if you have or are using some
implemtation yourself).

Any help appreciated.

Regards, Ron AF Greve.

Jul 19 '05 #1
18 10691

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

I am searching for the best lex and yacc combination (or something similar) that can be used in combination with C++ and that can contain C++ code. I
have the regular flex/bison port working but then I, of course, can't use
C++ constructs in the actions.


You can write "wrapper" functions that link to and call the actual C++ code.
What C++ code are you looking to use in the actions ?
Jul 19 '05 #2
On Wed, 8 Oct 2003 17:30:56 +0200, "Moonlit"
<al******@jupiter.universe> wrote:
Hi,

I am searching for the best lex and yacc combination (or something similar)
that can be used in combination with C++ and that can contain C++ code. I
have the regular flex/bison port working but then I, of course, can't use
C++ constructs in the actions.

I have tried spirit although I could make a simple command line parser
(after too many hours), creating a parser tree with it was not possible in
an easy way (the compiler choked while compiling the include files), so back
to a lex/yacc clone I guess.


There is a spirit mailing list I believe:

https://lists.sourceforge.net/lists/...spirit-general

Compatibility information is here:

http://www.boost.org/libs/spirit/doc/portability.html

Tom
Jul 19 '05 #3
Hi,

Thanks for your reply.

Ah, they should have linked that on their front page I think. Now I see my
vc6 is apparently
not supported (well not the parse trees, but without them ....).

I tried actually their news server but for some reason my news post won't
arrive there though I can read the other posts.

Has someone got experience with some kind of language parser (doesn't have
to be big but at least with more than say 20 rules) with vc7.1 and spirit.

I must admit the way you can write your parser just in C++ code appeals to
me a lot, that's why I spend already so much time on it and I would be
willing to buy the 7.1 compiler just for that, if I would be at least
recently confident that I could use it then (with parse trees of reasonable
size).

Thanks for your reply again.
Regards, Ron AF Greve.



"tom_usenet" <to********@hotmail.com> wrote in message
news:44********************************@4ax.com...
On Wed, 8 Oct 2003 17:30:56 +0200, "Moonlit"
<al******@jupiter.universe> wrote:
Hi,

I am searching for the best lex and yacc combination (or something similar)that can be used in combination with C++ and that can contain C++ code. I
have the regular flex/bison port working but then I, of course, can't use
C++ constructs in the actions.

I have tried spirit although I could make a simple command line parser
(after too many hours), creating a parser tree with it was not possible inan easy way (the compiler choked while compiling the include files), so backto a lex/yacc clone I guess.


There is a spirit mailing list I believe:

https://lists.sourceforge.net/lists/...spirit-general

Compatibility information is here:

http://www.boost.org/libs/spirit/doc/portability.html

Tom

Jul 19 '05 #4
Hi,

Well amongst other things I would like to fill STL map templates with thing
like var[ "name" ] = etc, also I would call some classes to log info like
"Output << Debuginfo << End;" (the "End" is not a typo). But of course other
things too. In the past I just used a flex/bison scanner and then afterwards
I parsed the tree and created a tree of classes of it. Yes, that works and
it is easy to write but it feals like doing everything twice.

Actually I must admit I have never tried to call C++ from C I know of course
your can wrap stuff like in extern "C" { FILE* yyin; }. Would extern "C++"
{ CWhatEver *ClassFactory(); } let you do that the other way around? It
would be a solution although of course you get a lot of type casting and
loose the type checking.

Well its worth trying if there isn't a better solution.

Thanks for your reply.

Regards, Ron AF Greve.

"Kris Wempa" <calmincents(NO_SPAM)@yahoo.com> wrote in message
news:bm**********@kcweb01.netnews.att.com...

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

I am searching for the best lex and yacc combination (or something similar)
that can be used in combination with C++ and that can contain C++ code. I have the regular flex/bison port working but then I, of course, can't use C++ constructs in the actions.


You can write "wrapper" functions that link to and call the actual C++

code. What C++ code are you looking to use in the actions ?

Jul 19 '05 #5
Moonlit wrote in news:3f***********************@news.xs4all.nl:
Ah, they should have linked that on their front page I think. Now I
see my vc6 is apparently
not supported (well not the parse trees, but without them ....).

I tried actually their news server but for some reason my news post
won't arrive there though I can read the other posts.
I belive you have too register for there mailing list's before you
can post.

http://www.boost.org/more/mailing_lists.htm

Has someone got experience with some kind of language parser (doesn't
have to be big but at least with more than say 20 rules) with vc7.1
and spirit.

I must admit the way you can write your parser just in C++ code
appeals to me a lot, that's why I spend already so much time on it and
I would be willing to buy the 7.1 compiler just for that, if I would
be at least recently confident that I could use it then (with parse
trees of reasonable size).


Last time I checked the .NET SDK it came with a version (comandline only)
of the 7.1 compiler.

Also see/ask in: news://comp.compilers from what I see the topic is
mostly parsing.
Rob.
--
http://www.victim-prime.dsl.pipex.com/
Jul 19 '05 #6

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

Well amongst other things I would like to fill STL map templates with thing like var[ "name" ] = etc, also I would call some classes to log info like
"Output << Debuginfo << End;" (the "End" is not a typo). But of course other things too. In the past I just used a flex/bison scanner and then afterwards I parsed the tree and created a tree of classes of it. Yes, that works and
it is easy to write but it feals like doing everything twice.


The only way you can use maps this way is to either:

1) create a map instance in a C++ compiler, write C functions to call the
map methods, give these C functions C linkage with: extern "C" {} and call
them from the flex/bison generated C program.

2) write the C only flex/bison code and generate the .c files, manually
edit the .c files to insert your C++ code, compile the resulting code with a
C++ compiler

Step 2 can be messy if your grammar is very large. I haven't looked at
flex/bison output in a long time, so I don't remember how ugly it can get.
Step 1 is easier, but you will also lose the ease of using the maps
directly. You'd essentially be calling a wrapper insert() function instead
of simply assigning the field/value like you have shown above. In other
words:

var[(string) "field"] = ((string) "value");

would become something like

mapinsert("field","value");

I hope these give you some ideas.
Jul 19 '05 #7

"Kris Wempa" <calmincents(NO_SPAM)@yahoo.com> wrote in message
news:bm**********@kcweb01.netnews.att.com...

1) create a map instance in a C++ compiler, write C functions to call the


Sorry, that should be "in a C++ file" .... not compiler
Jul 19 '05 #8

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

I am searching for the best lex and yacc combination (or something similar) that can be used in combination with C++ and that can contain C++ code. I
have the regular flex/bison port working but then I, of course, can't use
C++ constructs in the actions.


I absolutely love ANLTr. It will generate Java, C++, and C#. I use it for
C++. It has a steep learning curve, but is very powerful. It will generate
LL(k) grammars, and has a lot of neat features like semantic and syntactic
predicates. It generates surprising tight code--looks like a hand-generated
parser. The parse and lexer creation process is well integrated.
http://www.antlr.org
DrX.
Jul 19 '05 #9
Hi,

I didn't actually know you could call c from c++ that way, so thanks for the
ideas. However I usually build a tree from the input. In C I creates structs
(with a number assigned so I know what it represents) in most actions an
return pointers to it, what I end up then is a tree that represents the
input. Though it is not impossible to do the same using your first method, I
think it would be not easy to maintain but indeed you would only have to
build a tree once unlike twice as I do it now (first C then convert it to
C++).

Editing the generated code I would rather not, at some point you always
change the grammar and have to redo the changes.

Thanks for the reply.

Regards, Ron AF Greve.
"Kris Wempa" <calmincents(NO_SPAM)@yahoo.com> wrote in message
news:bm**********@kcweb01.netnews.att.com...

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

Well amongst other things I would like to fill STL map templates with thing
like var[ "name" ] = etc, also I would call some classes to log info like "Output << Debuginfo << End;" (the "End" is not a typo). But of course

other
things too. In the past I just used a flex/bison scanner and then

afterwards
I parsed the tree and created a tree of classes of it. Yes, that works and it is easy to write but it feals like doing everything twice.


The only way you can use maps this way is to either:

1) create a map instance in a C++ compiler, write C functions to call the
map methods, give these C functions C linkage with: extern "C" {} and call
them from the flex/bison generated C program.

2) write the C only flex/bison code and generate the .c files, manually
edit the .c files to insert your C++ code, compile the resulting code with

a C++ compiler

Step 2 can be messy if your grammar is very large. I haven't looked at
flex/bison output in a long time, so I don't remember how ugly it can get.
Step 1 is easier, but you will also lose the ease of using the maps
directly. You'd essentially be calling a wrapper insert() function instead of simply assigning the field/value like you have shown above. In other
words:

var[(string) "field"] = ((string) "value");

would become something like

mapinsert("field","value");

I hope these give you some ideas.

Jul 19 '05 #10
Hi,

"Xenos" <do**********@spamhate.com> wrote in message
news:bm*********@cui1.lmms.lmco.com...

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

I am searching for the best lex and yacc combination (or something similar)
that can be used in combination with C++ and that can contain C++ code. I have the regular flex/bison port working but then I, of course, can't use C++ constructs in the actions.


I absolutely love ANLTr. It will generate Java, C++, and C#. I use it

for C++. It has a steep learning curve, but is very powerful. It will generate LL(k) grammars, and has a lot of neat features like semantic and syntactic
predicates. It generates surprising tight code--looks like a hand-generated parser. The parse and lexer creation process is well integrated.
Ok, I think I have some reading to then. I already went over all the spirit
documentation. And despite that my VC6 compiler, generated invalid object
files, stack overlows and internal compiler errors.. well apart from that I
liked it.

But I think I just give antlr a try as well.

Thanks for the link and the reply.

Regards, Ron AF Greve.

http://www.antlr.org
DrX.

Jul 19 '05 #11
"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
[...]
I must admit the way you can write your parser just in C++
code appeals to me a lot, that's why I spend already so
much time on it and I would be willing to buy the 7.1
compiler just for that, if I would be at least recently
confident that I could use it then (with parse trees of
reasonable size).


If you're willing to switch compilers, try gcc/cygwin.
Unless your grammar is very large. Then compile times
or instantiation depth might slay you. You can always
break your grammar up into parts, which helps, but Spirit
can't really compete with traditional compiler compilers
for very large projects. For small and medium size stuff,
though, it's very very sweet. I'm using the ASTs with gcc,
and while they aren't as well-developed as they could be,
it's amazing how much power you get from just a few
lines of code. It's almost like coding in VB without all
the nasty stuff you get with VB.

Dave

---
Outgoing mail is certified Virus Free.
Checked by AVG anti-virus system (http://www.grisoft.com).
Version: 6.0.521 / Virus Database: 319 - Release Date: 9/23/2003
Jul 19 '05 #12
Hi,

"David B. Held" <dh***@codelogicconsulting.com> wrote in message
news:bm**********@news.astound.net...
"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
[...]
I must admit the way you can write your parser just in C++
code appeals to me a lot, that's why I spend already so
much time on it and I would be willing to buy the 7.1
compiler just for that, if I would be at least recently
confident that I could use it then (with parse trees of
reasonable size).
If you're willing to switch compilers, try gcc/cygwin.
Unless your grammar is very large. Then compile times
or instantiation depth might slay you. You can always
break your grammar up into parts, which helps, but Spirit
can't really compete with traditional compiler compilers
for very large projects. For small and medium size stuff,
though, it's very very sweet. I'm using the ASTs with gcc,
and while they aren't as well-developed as they could be,
it's amazing how much power you get from just a few
lines of code. It's almost like coding in VB without all
the nasty stuff you get with VB.


Yes, it appeared to me that with spirit you could do things with just a few
lines of code and without the hassle of first compiling with bison and flex.
Unfortunately the ast stuff doesn't work for vc6.

I tried the gcc/cygwin solution one day (I do use g++ for unix platforms),
many years ago and things might have improved. But at that time, though I
could create a window, it really was lacking the IDE that goes with gcc. I
know there is ddd and such but VC6's IDE is real easy to use. It really
reduces the development time a lot (not to mention all the documentation
that you get with it)

Thanks for your reply,

Ron AF Greve.

Dave

---
Outgoing mail is certified Virus Free.
Checked by AVG anti-virus system (http://www.grisoft.com).
Version: 6.0.521 / Virus Database: 319 - Release Date: 9/23/2003

Jul 19 '05 #13
In article <3f***********************@news.xs4all.nl>,
al******@jupiter.universe says...
Hi,

I am searching for the best lex and yacc combination (or something similar)
that can be used in combination with C++ and that can contain C++ code. I
have the regular flex/bison port working but then I, of course, can't use
C++ constructs in the actions.


Flex (at least in recent versions) produces output that can be compiled
as C++. In fact, with the "-+" flag, it'll produce real C++ output
(i.e. the parser as a class instead of just C that happens to be
compilable as C++).

BYACC produces output that can be compiled as C++, and I've used C++
specific "stuff" in actions, including using a map for a symbol table,
much as you've mentioned.

One thing I should point out is that when I'm using C++, I generally do
not use %union and the built-in type system -- instead, I normally use
the C++ type system, typically with a polymorphic type.

--
Later,
Jerry.

The universe is a figment of its own imagination.
Jul 19 '05 #14
Hi,

I knew some flex implementations could do C++ (and some bison). However I
hoped there was some strong opionion on what to use on what not.

Apparently, there isn't one very good solution. I haven't made up my mind
yet but willl add byacc to it.

For mysef I made the following list:

spririt very tight code, is C++ code, no extra dependecies, know how it
works, unfortunately only got very small, simple command line parsers
working (migh be due to my VC6 version, certainly have to buy vc7.1 then)

Antlr Don't know anything about this, seems widely supported for different
languages, user java to generate code (I think).

Flex++/Bison++/byacc different versions on the net, lot of experience with
flex/bison so probably the most easy to use, more code than with spirit but
very likely more compatible with any compiler arround..

Hmmm, still difficult to choose, ok at some point I just have to pick one I
guess.

I just decided to order my copy of vc++ 2003, hope it works with spirit and
well, I could always backtrack to flex++/byacc/bison++ if not.
Thanks for your help.

Regards, Ron AF Greve.
"Jerry Coffin" <jc*****@taeus.com> wrote in message
news:MP************************@news.clspco.adelph ia.net...
In article <3f***********************@news.xs4all.nl>,
al******@jupiter.universe says...
Hi,

I am searching for the best lex and yacc combination (or something similar) that can be used in combination with C++ and that can contain C++ code. I have the regular flex/bison port working but then I, of course, can't use C++ constructs in the actions.


Flex (at least in recent versions) produces output that can be compiled
as C++. In fact, with the "-+" flag, it'll produce real C++ output
(i.e. the parser as a class instead of just C that happens to be
compilable as C++).

BYACC produces output that can be compiled as C++, and I've used C++
specific "stuff" in actions, including using a map for a symbol table,
much as you've mentioned.

One thing I should point out is that when I'm using C++, I generally do
not use %union and the built-in type system -- instead, I normally use
the C++ type system, typically with a polymorphic type.

--
Later,
Jerry.

The universe is a figment of its own imagination.

Jul 19 '05 #15

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

Antlr Don't know anything about this, seems widely supported for different languages, user java to generate code (I think).
yes it is written in Java.
Hmmm, still difficult to choose, ok at some point I just have to pick one I guess.
You might also check out :
PCCTS -- This the predecessor to ANLTr, but it is written in C++.

There is a nice list of compiler compilers here:
http://catalog.compilertools.net

I just decided to order my copy of vc++ 2003, hope it works with spirit and well, I could always backtrack to flex++/byacc/bison++ if not.

The only problem I see with this is the latest version of VC++ still has
weak template support, and as you already know, Spirit is very template
intensive. Have you checked out the BOOST library, to which Spirit was
resently added too? It has some nice workarounds for various compilers.
DrX

Jul 19 '05 #16
Hi,

"Xenos" <do**********@spamhate.com> wrote in message
news:bm*********@cui1.lmms.lmco.com...

"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl...
Hi,

Antlr Don't know anything about this, seems widely supported for different
languages, user java to generate code (I think).


yes it is written in Java.
Hmmm, still difficult to choose, ok at some point I just have to pick one I
guess.
You might also check out :
PCCTS -- This the predecessor to ANLTr, but it is written in C++.

There is a nice list of compiler compilers here:
http://catalog.compilertools.net

Thanks, I will check them out.

I just decided to order my copy of vc++ 2003, hope it works with spirit

and
well, I could always backtrack to flex++/byacc/bison++ if not.

The only problem I see with this is the latest version of VC++ still has
weak template support, and as you already know, Spirit is very template
intensive. Have you checked out the BOOST library, to which Spirit was
resently added too? It has some nice workarounds for various compilers.


Well they say over in the spirit newsgroup that vc7.1 compiles very well,
but of course, the proof of the...

I tried different versions of spirit 1.6.1 (the latest stable release).
Could create a simple parser but when I wanted to use the ast templates it
failed, without that I don't think it is possible to write a (maintainable)
parser. The 1.7 release doesn't even compile, it gives a error in a certain
line.

DrX


Thanks, for your reply.
Jul 19 '05 #17
"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl
I just decided to order my copy of vc++ 2003, hope it works with spirit

and
well, I could always backtrack to flex++/byacc/bison++ if not.

The only problem I see with this is the latest version of VC++ still has
weak template support, and as you already know, Spirit is very template
intensive. Have you checked out the BOOST library, to which Spirit was
resently added too? It has some nice workarounds for various compilers.


Well they say over in the spirit newsgroup that vc7.1 compiles very well,
but of course, the proof of the...

I tried different versions of spirit 1.6.1 (the latest stable release).
Could create a simple parser but when I wanted to use the ast templates it
failed, without that I don't think it is possible to write a (maintainable)
parser. The 1.7 release doesn't even compile, it gives a error in a certain
line.


Hi,

AFAIK, 1.7 compiles cleanly on VC 7.1 (all regressions pass). Could you
be more specific with the compilation errors you are getting? I'd appreciate it
if you can post some code that exhibits the problem in Spirit's mailing list.
Rest assured, we are trying our best to make things work as smoothly as
possible.

Regards,
--
Joel de Guzman
http://www.boost-consulting.com
http://spirit.sf.net

Jul 19 '05 #18
Hi,

Thanks Joel four your reply and all your guys for working on spirit, I realy
love to just write C++ code and not have to mix C and/or precompile stuff.

I have got my VC7.1 version in. And it seems to compile fine (though I
didn't create any more than some simple things), but it did compile the same
example project that couldn't be compiled with VC6.0 and it works!

However with the VC6.0 the following errors are given as soon as I use ast
stuff (I could create a simple command line parser though) if you are
interested:

This is the ast_calc from the example section (the regular calc works fine
with VC6.0).

Compiling...
ast_calc.cpp
h:\include\boost\spirit\tree\common.hpp(207) : error C2984: 'node_iter_data'
: template parameters '' and '' do not match
h:\include\boost\spirit\tree\common.hpp(207) : see declaration of
'node_iter_data'
h:\include\boost\spirit\tree\common.hpp(534) : error C2989:
'tree_match_attr<class boost::reference_wrapper<T> >' : template class has
already been defined as a non-template class
h:\include\boost\spirit\tree\common.hpp(534) : error C2988: unrecognizable
template declaration/definition
h:\include\boost\spirit\tree\common.hpp(569) : fatal error C1903: unable to
recover from previous error(s); stopping compilation
Thanks for your great work,

Regards, Ron AF Greve

"Joel de Guzman" <dj****@gmx.co.uk> wrote in message
news:bm************@ID-58159.news.uni-berlin.de...
"Moonlit" <al******@jupiter.universe> wrote in message
news:3f***********************@news.xs4all.nl
I just decided to order my copy of vc++ 2003, hope it works with spirit and
well, I could always backtrack to flex++/byacc/bison++ if not.

The only problem I see with this is the latest version of VC++ still has weak template support, and as you already know, Spirit is very template
intensive. Have you checked out the BOOST library, to which Spirit was
resently added too? It has some nice workarounds for various
compilers.
Well they say over in the spirit newsgroup that vc7.1 compiles very well, but of course, the proof of the...

I tried different versions of spirit 1.6.1 (the latest stable release).
Could create a simple parser but when I wanted to use the ast templates it failed, without that I don't think it is possible to write a (maintainable) parser. The 1.7 release doesn't even compile, it gives a error in a certain line.
Hi,

AFAIK, 1.7 compiles cleanly on VC 7.1 (all regressions pass). Could you
be more specific with the compilation errors you are getting? I'd

appreciate it if you can post some code that exhibits the problem in Spirit's mailing list. Rest assured, we are trying our best to make things work as smoothly as
possible.

Regards,
--
Joel de Guzman
http://www.boost-consulting.com
http://spirit.sf.net

Jul 19 '05 #19

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

4
by: Profetas | last post by:
Hi. I was wondering how can I access the yacc functions? because when use a normal yacc function such as qstring { yylval.string = strdup(yytext+1); if(yylval.string !='"')...
4
by: Rodrick Brown | last post by:
This might be off topic but can someone give me a quick run down on why tools like lexx/yacc/bison are usefull ? I know what there used for but not sure when they should be used and where ? ...
6
by: Volker Hetzer | last post by:
Hi! We are finding ourselves in a situation where we have to parse several more or less free format text files. In the past, on linux, we had flex and bison for generating very fast parsers for...
1
by: deepusrp | last post by:
Helo everyone, i am doing a project on some graphic tool using qt as the front end. i am using lex and yacc as parser. now i am facing a problem since yacc generates only c code as i want to...
13
by: Berk Birand | last post by:
Hi, I am working on a school project where we use lex/yacc to write a compiler for a fictional (Java-like) language. I have handled all the details about the yacc and lex files, but I still have...
2
by: max.giacometti | last post by:
Hi everybody! I am using lex and yacc to write a vhdl to systemc converter. Lex simply reads the input file and yacc implements grammar and translation. I'd like to be able to make yacc...
2
by: Mohitz | last post by:
Hi Guys, I am facing a peculiar problem with my yacc script. Following is the snippet of the yacc script that i am using. I am using lex as the lexical analyzer. Sample Input :
1
by: Robert | last post by:
If the goal is to take a 1-dimensional package of text and produce a tree data structure that is easy to understand and manipulate, and then write C/C++ code that works with that tree - does...
1
by: mh | last post by:
I'm porting a C lex/yacc based project, and would like to redo it in python. What's the best option for a python lex/yacc-like? I've googled a few things, but wanted to see the current...
0
by: taylorcarr | last post by:
A Canon printer is a smart device known for being advanced, efficient, and reliable. It is designed for home, office, and hybrid workspace use and can also be used for a variety of purposes. However,...
0
by: ryjfgjl | last post by:
In our work, we often receive Excel tables with data in the same format. If we want to analyze these data, it can be difficult to analyze them because the data is spread across multiple Excel files...
0
by: emmanuelkatto | last post by:
Hi All, I am Emmanuel katto from Uganda. I want to ask what challenges you've faced while migrating a website to cloud. Please let me know. Thanks! Emmanuel
0
BarryA
by: BarryA | last post by:
What are the essential steps and strategies outlined in the Data Structures and Algorithms (DSA) roadmap for aspiring data scientists? How can individuals effectively utilize this roadmap to progress...
1
by: nemocccc | last post by:
hello, everyone, I want to develop a software for my android phone for daily needs, any suggestions?
1
by: Sonnysonu | last post by:
This is the data of csv file 1 2 3 1 2 3 1 2 3 1 2 3 2 3 2 3 3 the lengths should be different i have to store the data by column-wise with in the specific length. suppose the i have to...
0
by: Hystou | last post by:
There are some requirements for setting up RAID: 1. The motherboard and BIOS support RAID configuration. 2. The motherboard has 2 or more available SATA protocol SSD/HDD slots (including MSATA, M.2...
0
Oralloy
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,...
0
jinu1996
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...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.