Flex and Bison, the first is a lexical analyzer generator, and the the second a parser generator, two useful tools for making programs that reacts to a data input with a predefined structure and language, for example, we can make compilers, script interpreters and command line parsers.
This is not aimed to be a tutorial of Flex and Bison, if you want to learn how to use this programs I encourage reading their respective manuals, but a simple example on how to integrate these to Qt.
Mar 1, 2013
Dec 22, 2012
Object Oriented Programming in Bash
Bash is a very common *nix shell, and it's programming language is purely procedural and focused on command execution. Object Oriented Programming (OOP) is a programming paradigm that represents the elements of a problem as entities with a set of properties and actions that it can execute. If you use Bash to write very simple and short scripts, procedural programming is just fine, you don't need more. But if your program becomes more and more bigger, a monster program (> 1000 lines), then you need a better way to structure your program to make it easy to maintain and read. Of course, Bash lacks OOP features, but with some tricks you can simulate it with a few lines added, and I'll show you how.
Publicado por
hipersayan_x
27 comments:
Etiquetas:
Programming
Nov 5, 2012
About Webcamoid and the transition to Carnival-LiveCam
As (may be) you know, I have two main projects: Carnival-LiveCam and Webcamoid, both are brother projects, both focussed on filling the gap of a good Free open source webcam software.
![]() |
| This should be Webcamoid 4.0.0 |
Publicado por
hipersayan_x
No comments:
Etiquetas:
My Projects
Oct 13, 2012
Qt5 in ArchLinux
If you are a Qt developer and an ArchLinux user, and you want to give a try to the new Qt5 this post is for you. I will show you how to setup the Qt5 development environmet correctly.
Publicado por
hipersayan_x
3 comments:
Etiquetas:
Programming
Aug 10, 2012
Longest Common Subsequence in Python (version 3.0)
This is my new implementation of the Longest Common Subsequence algorithm, and it's far better than my two previous attempts. This algorithm has less memory usage and is faster than the others because it just compares the common elements.
Publicado por
hipersayan_x
1 comment:
Etiquetas:
Programming
Subscribe to:
Posts (Atom)


