473,516 Members | 3,248 Online
Bytes | Software Development & Data Engineering Community
+ Post

Home Posts Topics Members FAQ

How is a compiler written

Where can I find a good resource, on the web, that will give me a good
comprehensive idea of how to write a compiler in C for C or maybe
another language.


http://petantik.blogsome.com - A Lucid look at Reality ... maybe?

Nov 15 '05 #1
19 2042
Well, I did not google it, but the best way to write a compiler is
using the tools, "lex" and "yacc" (or also known as - with some
differences - "flex" and "bison"), the first one is a lexer
(scanner-lexical analyzer), and the second one is a parser.

I am sure you can find most of the info in the web, but if you really
want to learn this stuff, I would suggest you to buy the "Dragon Book",
which is formally named "Compilers, Principles, Techniques, and Tools"
by Aho, Sethi and Ullman, this is the de-facto book in the field.

Nov 15 '05 #2
"tuncay tekle" <tu*****@gmail.com> writes:
Well, I did not google it, but the best way to write a compiler is
using the tools, "lex" and "yacc" (or also known as - with some
differences - "flex" and "bison"), the first one is a lexer
(scanner-lexical analyzer), and the second one is a parser.

I am sure you can find most of the info in the web, but if you really
want to learn this stuff, I would suggest you to buy the "Dragon Book",
which is formally named "Compilers, Principles, Techniques, and Tools"
by Aho, Sethi and Ullman, this is the de-facto book in the field.


I take it you haven't been following this newsgroup closely. If you
had, you would know by now that it's unsafe to assume that everyone
can see the article to which you're replying, and that you need to
provide some context.

If you want to post a followup via groups.google.com, don't use
the broken "Reply" link at the bottom of the article. Click on
"show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers.

And please complain to Google about their broken interface.

As for the original question, parsing C turns out to be fairly
difficult because of the typedef problem. A typedef name is lexically
an identifier, but it acts like a reserved word -- but only in the
scope where it's defined. That means your parser can't analyze the
code without feedback from the symbol table.

Once you've solved this, you've still done only a fraction of the work
necessary to implement a compiler. You should ask yourself whether
it's really worth the effort, given that ther are a number of freeware
C compilers already. I'm not by any means saying you shouldn't do it,
just that it's going to be a lot of work.

There's also a "comp.compilers" newsgroup (which you should browse for
a while before posting, and read the FAQ if they have one).

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.
Nov 15 '05 #3
In article <11**********************@z14g2000cwz.googlegroups .com>,
petantik <pe***********@gmail.com> wrote:
Where can I find a good resource, on the web, that will give me a good
comprehensive idea of how to write a compiler in C for C or maybe
another language.


http://www.google.com/search?q=0201100886
dave
(bonus points if you don't have to follow the link to know what I'm
talking about)

--
Dave Vandervies dj******@csclub.uwaterloo.ca
First person to write a compiler that makes an working executable
out of this gets shot.
--Geoff Summerhayes in comp.lang.c
Nov 15 '05 #4
you are right :) it's my first time posting anything in a group..

it doesn't make sense to me how google ignores this bug though

Keith Thompson wrote:
"tuncay tekle" <tu*****@gmail.com> writes:
Well, I did not google it, but the best way to write a compiler is
using the tools, "lex" and "yacc" (or also known as - with some
differences - "flex" and "bison"), the first one is a lexer
(scanner-lexical analyzer), and the second one is a parser.

I am sure you can find most of the info in the web, but if you really
want to learn this stuff, I would suggest you to buy the "Dragon Book",
which is formally named "Compilers, Principles, Techniques, and Tools"
by Aho, Sethi and Ullman, this is the de-facto book in the field.


I take it you haven't been following this newsgroup closely. If you
had, you would know by now that it's unsafe to assume that everyone
can see the article to which you're replying, and that you need to
provide some context.

If you want to post a followup via groups.google.com, don't use
the broken "Reply" link at the bottom of the article. Click on
"show options" at the top of the article, then click on the
"Reply" at the bottom of the article headers.

And please complain to Google about their broken interface.

As for the original question, parsing C turns out to be fairly
difficult because of the typedef problem. A typedef name is lexically
an identifier, but it acts like a reserved word -- but only in the
scope where it's defined. That means your parser can't analyze the
code without feedback from the symbol table.

Once you've solved this, you've still done only a fraction of the work
necessary to implement a compiler. You should ask yourself whether
it's really worth the effort, given that ther are a number of freeware
C compilers already. I'm not by any means saying you shouldn't do it,
just that it's going to be a lot of work.

There's also a "comp.compilers" newsgroup (which you should browse for
a while before posting, and read the FAQ if they have one).

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.


Nov 15 '05 #5
In article <11**********************@g47g2000cwa.googlegroups .com>,
tuncay tekle <tu*****@gmail.com> wrote:
Well, I did not google it, but the best way to write a compiler is
using the tools, "lex" and "yacc" (or also known as - with some
differences - "flex" and "bison"), the first one is a lexer
(scanner-lexical analyzer), and the second one is a parser.

I am sure you can find most of the info in the web, but if you really
want to learn this stuff, I would suggest you to buy the "Dragon Book",
which is formally named "Compilers, Principles, Techniques, and Tools"
by Aho, Sethi and Ullman, this is the de-facto book in the field.


The Dragon Book is a good one suggestion, but suggesting the
best way to write a compiler is with lex and yacc is not.
This is completely OT and best is a compiler NG, say comp.compilers
--
Greg Comeau / Celebrating 20 years of Comeauity!
Comeau C/C++ ONLINE ==> http://www.comeaucomputing.com/tryitout
World Class Compilers: Breathtaking C++, Amazing C99, Fabulous C90.
Comeau C/C++ with Dinkumware's Libraries... Have you tried it?
Nov 15 '05 #6
petantik wrote:

Where can I find a good resource, on the web, that will give me a good
comprehensive idea of how to write a compiler in C for C or maybe
another language.

http://petantik.blogsome.com - A Lucid look at Reality ... maybe?


If you are really interested in this I suggest you get hold of a copy of
"the dragon book" (so-called because it has a dragon on the cover):

"Compilers, principles, techniques, and tools"

by Alfred V. Aho, Ravi Sethi and Jeffrey D. Ullman
(Addison-Wesley Pub. Co., Reading, Mass., 1986).

Once you have had a look at this you can decide rationally whether you
want to make a recursive-descent, tree- or table-driven compiler.

Then I suggest as an exercise writing a simple formula evaluator in your
language of choice. That is, you type in a formula of the form

b*c/cosh(d)

and have the result displayed on the output. For example, I use the Forth
language that does not have intrinsic formula translation like Fortran, C,
etc. So I wrote such a beast using recursive-descent (Forth is stack-based,
and recursion uses stacks, so that seemed most natural). The translator
will evaluate a formula, as with (this is actual screen output)

fvariable x fvariable y ok
f$" x=3" f$" y=4" ok
f$" x*(x^2+y^2)" f. 75.0000 ok

You can look at the code for this (which should be easily portable to C)
at

http://galileo.phys.virginia.edu/cla...1/programs.htm

There are 3 versions of the FORmula TRANslator, reflecting changes in
my thinking (and increased capabilities of what it will translate).

(Before anyone singes me for mentioning Forth on the C newsgroup, let me
note that the inquirer asked for a Web-based resource and this is the only
one I am truly familiar with.)

In particular look at the "docs" link because it discusses the Backus-Naur
specification of this formula parser.
If Forth doesn't please you--and there is no reason why it should, as many
don't like it at all--you can look at Kruse, "Data Structures and Program
Design". There are versions in Pascal, C and C++ . Among other things he
shows you how to write a tree-structured formula evaluator.

If Forth *does* grab you, there exists a generalized program called "gray"
for creating parsers in the Forth language. It is more-or-less the
Forth equivalent of YACC (see below), and was written by Anton Ertl.

http://www.complang.tuwien.ac.at/projects/forth.html

Ertl provides examples: an integer 4-function calculator, a tiny Pascal,
and an Oberon -> Forth translator.

Finally there is YACC --"yet another compiler-compiler"-- a tool in C
used for automating the development of C code for translating any language
you input to any other one, as long as you adhere to its rules. See, e.g.

http://epaperpress.com/lexandyacc/

I hope these resources help.

--
Julian V. Noble
Professor Emeritus of Physics

http://galileo.phys.virginia.edu/~jvn/

"As democracy is perfected, the office of president represents, more and
more closely, the inner soul of the people. On some great and glorious
day the plain folks of the land will reach their heart's desire at last
and the White House will be adorned by a downright moron."

--- H. L. Mencken (1880 - 1956)
Nov 15 '05 #7
"tuncay tekle" <tu*****@gmail.com> writes:
you are right :) it's my first time posting anything in a group..

it doesn't make sense to me how google ignores this bug though


It doesn't make sense to the rest of us either.

One more thing: please don't top-post. Your response goes below, or
interspersed with, any quoted text, so the article can be read
naturally from top to bottom. It's not usually necessary to quote the
entire article, only the portions relevant to your reply.

And the shift key is your friend. Standard capitalization really does
make your text easier to read.

Welcome to the group!

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.
Nov 15 '05 #8
Greg Comeau wrote:
The Dragon Book is a good one suggestion, but suggesting the
best way to write a compiler is with lex and yacc is not.
This is completely OT and best is a compiler NG, say comp.compilers


I know it is still OT but since you made a point I wondered what you
would suggest instead of lex & yacc. I mean, hey, these are powerful
tools. :)

Nov 15 '05 #9
tuncay tekle wrote:
Greg Comeau wrote:
The Dragon Book is a good one suggestion, but suggesting the
best way to write a compiler is with lex and yacc is not.
This is completely OT and best is a compiler NG, say comp.compilers

I know it is still OT but since you made a point I wondered what you
would suggest instead of lex & yacc. I mean, hey, these are powerful
tools. :)


They're also dinosaurs. Or, as the lex manual puts it, "the asteroid to
kill this dinosaur is still in orbit".

Lex and yacc came first and did a good job. As a result they're now
ubiquitous, ported to just about every platform and remade in just about
any language, but that doesn't mean they're always the best approach to
lexer/parser generation. Their portability is a big win, but they have
some warts that are as annoying as (say) having to use tabs in
makefiles, and they're very barebones for use in something as big as a
compiler.

Check out ANTLR, for example: http://www.antlr.org/. It doesn't generate
C, but it's a lot friendlier than the lex/yacc combo. There are loads
and loads of other lexer/parser generators, many better than lex/yacc
for many purposes.

Lex and yacc will continue to be around in the foreseeable future
because just about any Unix-like platform has them (and a C compiler),
but they're the first word, not the last.

S.
Nov 15 '05 #10
Skarmander wrote:
Check out ANTLR, for example: http://www.antlr.org/. It doesn't generate
C, but it's a lot friendlier than the lex/yacc combo. There are loads
and loads of other lexer/parser generators, many better than lex/yacc
for many purposes.


Of course, I do know that lex & yacc are the dinasours, but when it
comes to friendliness, I would not conclude lex & yacc are your best
friends (first of all, they are hard to debug) but they are as friendly
as C and UNIX goes.

The point is what do you mean by *better*. What I wonder is in terms of
power, is there any lexer/parser doing sth that lex&yacc cannot do
(easily) - ANTLR did not look promising to me in this context. By the
way, no offense in any means, I am not defending these tools, I am just
curious :)

Nov 15 '05 #11
petantik wrote:
Where can I find a good resource, on the web, that will give me a good
comprehensive idea of how to write a compiler in C for C or maybe
another language.


http://petantik.blogsome.com - A Lucid look at Reality ... maybe?


To understand how a C compiler works, one of the best books on this
subject is

A Retargetable C Compiler: Design and Implementation, Addison-Wesley
by Fraser and Hanson.

It is the description of the lcc compiler.
You can download the lcc source code from:
ftp://ftp.cs.princeton.edu/pub/packages/lcc/

The book is relatively easy to read, and the source code
is well documented.

jacob

Nov 15 '05 #12
On Mon, 31 Oct 2005 20:32:49 +0000 (UTC), in comp.lang.c ,
dj******@csclub.uwaterloo.ca (Dave Vandervies) wrote:
http://www.google.com/search?q=0201100886
dave
(bonus points if you don't have to follow the link to know what I'm
talking about)


Actually I think that should be minus points - memorising ISBNs is
very very sad...

--
Mark McIntyre
CLC FAQ <http://www.eskimo.com/~scs/C-faq/top.html>
CLC readme: <http://www.ungerhu.com/jxh/clc.welcome.txt>

----== Posted via Newsfeeds.Com - Unlimited-Uncensored-Secure Usenet News==----
http://www.newsfeeds.com The #1 Newsgroup Service in the World! 120,000+ Newsgroups
----= East and West-Coast Server Farms - Total Privacy via Encryption =----
Nov 15 '05 #13
Well its seems like quite a complex and large undertaking. I'm not
about to write a compiler - not yet anyway :) .

I just wanted to satisfy my curiosity especially since i'm doing a
CS/Engineering degree and am taking classes in Compter Architecture and
Design. Today we were discussing why CAD is important and writing
compilers was one of the issues raised by Duncan Smeed, my lecturer.


http://petantik.blogsome.com - keeping it real

Nov 15 '05 #14
tuncay tekle wrote:
Skarmander wrote:
Check out ANTLR, for example: http://www.antlr.org/. It doesn't generate
C, but it's a lot friendlier than the lex/yacc combo. There are loads
and loads of other lexer/parser generators, many better than lex/yacc
for many purposes.

Of course, I do know that lex & yacc are the dinasours, but when it
comes to friendliness, I would not conclude lex & yacc are your best
friends (first of all, they are hard to debug) but they are as friendly
as C and UNIX goes.

A very apt judgment, I'd say. Each reader can make of that what they
want. :-) I'll go on record as saying that settling for the
"friendliness" of C and Unix is something many programmers are too eager
to do.
The point is what do you mean by *better*.
Exactly. All I can say is that for *many* purposes, there are better
tools than lex/yacc. If you don't need to generate C, there's probably a
language-specific tool for you that will be more accommodating than
lex/yacc, and there's no reason not to use that. If you're working with
a language that's not conveniently described as an LALR grammar, there
are better tools than lex/yacc. If you find merging grammar rules and
code unmaintainable, there are better tools than lex/yacc.

All that doesn't mean lex/yacc have had their day and are inferior
tools. They are surprisingly effective in a great number of situations.
Shopping around a bit for potentially better solutions might pay off,
though. There's enough software to go around.
What I wonder is in terms of power, is there any lexer/parser doing
sth that lex&yacc cannot do (easily) - ANTLR did not look promising
to me in this context.
Oh, you literally mean parsing power? The answer is that it hardly matters.

Most parser generators are naturally tuned to producing efficient
parsers for programming languages. Any sane programming language can be
described with an LALR(1) grammar -- the kind yacc and many other tools
can parse. (C++ is a notable example of an "insane" language; people who
have tried to produce a pure LALR(1) grammar generally agree that it's
not worth the bother, and you're better off doing special processing on
a restricted grammar.)

In fact, many programming languages can be parsed with less than full
LALR. ANTLR is a so-called "predicated LL(k) parser", which is less
powerful than LALR(1), but you'll be hard-pressed to come up with a
language that has a practical LALR(1) grammar but no practical LL(k)
grammar. The theoretical limits of parser generators are real, but
matter surprisingly little in practice. It's mostly about how easy it is
to write things down.

And that depends. LR and LL are different flavors of ice cream; most
people find LL far easier to understand (none of that shift-reduce
hoopla) but LR allows some constructs to be written down more naturally
than LL. And vice versa, of course; it's hard to judge these things
objectively. Plus, each parser generator will have its own set of bells
and whistles that will allow you to write down certain common things
easily. It might have exactly what you need or miss the mark.

If you really need parsers with even *more* power, they exist, but even
when optimized for performance, these tend to be too slow to use for
tasks like compiling. For example, for most languages a complete
annotated syntax tree could be built with a context-sensitive parser,
instead of getting a context-free grammar with a tool like yacc and then
computing the context-sensitive bits. But context-sensitive parsing is
not easy to do efficiently (let alone linearly), and writing
context-sensitive grammars can be tricky as compared to the "compute
stuff on a context-free tree", which most programmers find quite natural
to do.

This is not the place to go into a discussion of the various tradeoffs
of parsers; if you don't know this stuff, I recommend getting a good
book on parsing techniques. One of my favorites is unimaginatively
titled "Parsing Techniques - A Practical Guide" by Grune and Jacobs, but
unfortunately it's currently out of print (I saw a second edition is in
the works, though, which is great). It also contains *way* more
information than you'll need for your average compiler, but I felt like
plugging it. :-)

Try Googling and asking around in comp.compilers. They should have
archives full of discussion on these matters. (Disclaimer: I've never
been there.) There's also an overview page of parser generators on
Wikipedia: http://en.wikipedia.org/wiki/Compiler-compiler. Look around,
see what you can find.
By the way, no offense in any means, I am not defending these tools,
I am just curious :)


It's highly unlikely you could say anything that would offend me, and it
certainly wouldn't involve opinions on parsing tools. Curiosity is good.

Bottom line: look beyond lex & yacc for fun and profit sometimes. Even
if you're going to stick with them for the rest of your days, it's nice
to know what else is out there.

S.
Nov 15 '05 #15
On 2005-10-31, tuncay tekle <tu*****@gmail.com> wrote:
Well, I did not google it, but the best way to write a compiler is
using the tools, "lex" and "yacc" (or also known as - with some
differences - "flex" and "bison"), the first one is a lexer
(scanner-lexical analyzer), and the second one is a parser.


Well, they're actually generators of such, but yeah. Though i have
been told that most compilers these days use higher-performance
solutions
Nov 15 '05 #16
hey keith, do you have any suggestions for how to be a prat? you know,
most people learn early in life to grow up. try it, you might like it :)

Nov 15 '05 #17
th******@hotmail.com writes:
hey keith, do you have any suggestions for how to be a prat? you know,
most people learn early in life to grow up. try it, you might like it :)


As a matter of fact, I do some suggestions. Just wait around until
you see someone offering sound advice, then barge in and throw a few
insults around. Pointedly ignoring the offered advice at the same
time might be a nice touch.

But I'm sure you don't need any suggestions from me on the topic.

--
Keith Thompson (The_Other_Keith) ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.
Nov 15 '05 #18
Jordan Abel wrote:

Well, they're actually generators of such, but yeah. Though i have
been told that most compilers these days use higher-performance
solutions


Lexing and parsing is a very small portion of what a compiler
does these days hence there is little to be gained in speed
by using hand written code in the lexer and parser when the
lex/yacc solution is already pretty damn good.

Erik
--
+-----------------------------------------------------------+
Erik de Castro Lopo
+-----------------------------------------------------------+
"Islam isn't in America to be equal to any other faith, but to become
dominant. The Koran should be the highest authority in America, and Islam
the only accepted religion on earth." -- Omar Ahmad, board chairman of
Council of American Islamic Relations to an islamic audience in 1998.
Nov 15 '05 #19
th******@hotmail.com wrote:
hey keith, do you have any suggestions for how to be a prat?


I don't know whether Keith does, but I do. It's an easy three-step
program:

1. Sign up for Google Groups Broken Beta
2. Switch off your brain
3. Start posting

Note that step 2. is crucial: without it, you might become only a decent
netizen struggling with a brainless interface, rather than a brainless
netizen inflicting the outfall of the interface on the rest of us, and
we can't have that, can we?

Richard
Nov 15 '05 #20

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

Similar topics

34
3649
by: Nikola Skoric | last post by:
Is the a PHP compiler? A program that compiles PHP code to executable which doesn't need php interpreter to execute... -- Pozdrav/Regards, Nikola Skoric. "...Usne, tice-rugalice - a u oku tajac Da sam kaput sa dva lica, da sam Gospo'n Propalica..." http://newusers.cjb.net/ - site o Usenetu na hrvatskom!
2
2313
by: Jeff Epler | last post by:
Hello. Recently, Generator Comprehensions were mentioned again on python-list. I have written an implementation for the compiler module. To try it out, however, you must be able to rebuild Python from source, because it also requires a change to Grammar. 1. Edit Python-2.3/Grammar/Grammar and add an alternative to the "listmaker"...
4
2298
by: Jørgen Hermanrud Fjeld | last post by:
On Tue, Aug 26, 2003 at 04:33:17PM -0500, Jeff Epler wrote: > 4. It's possible to write code so that __import__ uses compiler.compile > instead of the written-in-C compiler, but I don't have this code handy. > Also, a test suite is needed, and presumably a written-in-C implementation > as well. (option 2: make the compiler.compile interface...
7
2063
by: winlinchu | last post by:
Hi! I use Python, and writing some extension modules I think which could be written an C compiler, useful only to compile extension modules (I not think an GCC!!!!), so that the user not have to use GCC, Microsoft Visual C++, or other. It must have an common API to all platforms, even if obviously the implementation is various. Could be...
12
25423
by: Unbiased_me | last post by:
Hi There I recently read in book that the C compiler is written in C. I unable to comprehend the concept behind this. How is the compiler design started...Where dodoes one start. I tried Googling for the answer that C is written in C, however the web search proved futile. C # and .net is written in .net...What!, and the list goes on
7
1181
by: ndessai | last post by:
Hi All, I discovered following issue with the VC 7.1 compiler regarding the backword compatibility. I created a dll (Redirect.dll) which exposes a function and simply writes some text (say "Hello World") to stderr stream. I also created a driver program (driver.exe) and used the exposed function from the above dll. The driver.exe tries...
5
1778
by: rawCoder | last post by:
Hi All, In Visual Basic .NET , your function definition might requirre you to return a value but (accidently/intentionally) you dont put any 'return value' in the function. In this case VB Compiler does not generate any warning. Is there any way to make the compiler generate this and other obvious warnings, is there any switch, or...
8
1990
by: Charles Sullivan | last post by:
I have a program written in C under Linux (gcc) which a user has ported to run under AT&T SysV R4. He sent me a copy of his makelog which displays a large number of compiler warnings similar to this: warning: semantics of ">>" change in ANSI C; use explicit cast The statement to which this applies is: xuc = ((uc & 0xF0 ) >4);
30
2920
by: lovecreatesbea... | last post by:
K&R says the following in the preface to the first edition, "... the C compiler, and ... are written in C." I'm wondering, does it say even the first / original C compiler was written in C?
61
3185
by: dreamAnders | last post by:
ucc is an ANSI C Compiler. Its code size is about 15,000 lines. The lexer, parser and code generator are all hand-written. The code structure is very clear and straightforward. And there is an interesting value numbering algorithm. It also has a document explaining the internal implementation. If you are interested at this compiler, you can...
0
7273
marktang
by: marktang | last post by:
ONU (Optical Network Unit) is one of the key components for providing high-speed Internet services. Its primary function is to act as an endpoint device located at the user's premises. However, people are often confused as to whether an ONU can Work As a Router. In this blog post, we’ll explore What is ONU, What Is Router, ONU & Router’s main...
0
7182
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...
0
7405
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, 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. ...
0
7547
tracyyun
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...
0
5712
agi2029
by: agi2029 | last post by:
Let's talk about the concept of autonomous AI software engineers and no-code agents. These AIs are designed to manage the entire lifecycle of a software development project—planning, coding, testing, and deployment—without human intervention. Imagine an AI that can take a project description, break it down, write the code, debug it, and then...
0
4769
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...
0
3265
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...
1
823
muto222
by: muto222 | last post by:
How can i add a mobile payment intergratation into php mysql website.
0
487
bsmnconsultancy
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...

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.