Log in

Parsers in MUDs? - Mud Coders Community

> Recent Entries
> Archive
> Friends
> Profile

November 29th, 2005

Previous Entry Share Next Entry
10:12 am - Parsers in MUDs?
Just as a quick question, when people write muds, do many people ever use lex and yacc (or derivatives of them) for their parsing?

Is there a reason why you wouldn't want to? Like too difficult, or just troublesome to extend? Or some reason I'm missing totally?

Basically my one experience of a mud codebase was various version of AwakeMud (a derivative of circle which is a derivative of diku) which seemed to just write a flat parser in c... is this likely to be the rule or the exception for most muds out there?

On a total sidenote: when I first joined I mentioned an idea of writing a codebase in python, now it looks like it's entirely possible that I'll be able to use that idea for one of my CS projects this year.

(7 comments | Leave a comment)


Date:December 5th, 2005 06:56 am (UTC)
About your side note, how is your Python going? I read a lot of ideas made for using Python but find little about where it ends up. I'm working my way through a novice's version of a MUD server written entirely in Python and I'm wondering if you are already getting into your own.
[User Picture]
Date:December 12th, 2005 10:48 am (UTC)
Well, I never managed to get it off the ground over the past while. When I was in college, I was too busy concentrating on other things (which I got marks for), and when the summer came I was too busy job-hunting, and when I did get one, it took too much time.

But I have a fairly solid idea of how it'll work.

And now, I've emailed my lecturer about possibly doing it as a project for the next semester, which means that myself and 3 others will be able to work on the project and getting it off the ground.

So it's an ideal way for me to work on it, to set aside time (because it'll be my project), and it'll go a way to earning marks in my final grade. Now I just need to convince people that it's a good project to work on.

> Go to Top