Finally we’ve got the Bibliography working. Here is the two most used BibTeX enteries:

@Misc{WEBSIDE-skabelon,
title = {Web-title},
url = {http://www.cs.aau.dk},
note = {Dette er CS-websiden}
}

@Book{BOG-skabelon,
author = {Fortattere hvis flere adskilles de med and},
title = {Bogens titel},
publisher = {Forlag},
year = {2000},
edition = {First Edition}
}

When you cite a source in the report you can use the following commandd:

\cite{jon90}	–>	[21]
\citet{jon90}	–>	Jones et al. [21]
\citet[chap. 2]{jon90}	–>	Jones et al. [21, chap. 2]
\citep{jon90}	–>	[21]
\citep[chap. 2]{jon90}	–>	[21, chap. 2]
\citep[see][]{jon90}	–>	[see 21]
\citep[see][chap. 2]{jon90}	–>	[see 21, chap. 2]
\citep{jon90a,jon90b}	–>	[21, 32]

See NatBib for more info

Well, I’ve been coding for some hours now, fiddling around with implementing Dijkstra’s shortest path algorithm in momo.

I like it as it is right now, but due to our unfinished compiler, I can’t promise that it does’t contain errors

Also, I think we need a long talk about reference vs value representation of all of our types.

Check out the implementation here: ShortestPath.momo

A brand new C++ compiler with “implicit” parallelism from codeplay.

It’s directive based like OpenMP, but much easier, more effective, and able to split executable code
across different architectures (x86 and PhysX on same machine for instance).

http://www.theinquirer.net/default.aspx?article=38019

http://liquidweather.net/howto/index.php?id=60

Her har vi en guide til passwordless remote ssh login.

altid rart ikke at skulle skrive sit (8cifrede:-) password.

/kim

Du kan lave et checkout af vores svn repository:

Linux shel:


$ svn checkout svn+ssh://USERNAME@marge.cs.aau.dk/project/d207a/svnroot/

Windows Tortuise SVN:

Sæt URL of repository til:

svn+ssh://USERNAME@marge.cs.aau.dk/project/d207a/svnroot/

- Mikael

We've made our first version of our EBNF.

 Hope you enjoy it  

Our EBNF

So today we took the first steps, and tried to define some control structures and operators for our language. In the following documentation the symbol # will be used as a magic placeholder. This is what we came up with.

• To give us a greater freedom in the number department of our language, and because we like while-loops, we have decided NOT to include for-loops.
• We will implement a for all-loop in the language with the following syntax:
  for all # in #

  Note that this loop does not iterate through the datastructure in any specific order, and that it will want to have a lot of processes running at the same time, given that they are safe.

• A standard if sentence will be implemented:
  if # then # else #
• As mentioned before, we like while-loops:
  while #
• The following choices concerning operators were made:
  # + # (add # to #, if # are scalars; concatenate # and #, if # are strings)
  # – # (subtract # from #)
  # * # (multiply # with #)
  # / # (divide # with #)
  # := # (# becomes #)
  # mod # or # % # (# modulo #, which notation has not yet been chosen)
  #^# (empower # by #)
  # and # (and operator, for logical expressions)
  # or # (or operator, for logical expresseions)
  # = # (compare # to #)
  # <> # (# is different from #)
  |#| (the absolute value of #, if # is a scalar; the lenght of #, if # has one)

That is all for today. I hope I didn’t make too many typos.

~Kim