Implementation of algorithms designed to compute the First and Follow sets for all non-terminal symbols of a context-free grammar, as described in Compilers: Principles, Techniques, and Tools (2nd Edition) by Aho et al. This project is part of the formal languages and compilers course (ST0270) and fulfills the assignment requirements
active 2024-10-01 → 2024-10-01 (UTC)
Activity over time
Daily event counts in the loaded window
Line chart, 1 days from 2024-10-01 to 2024-10-01. Pushes: 1 total, peak 1 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.
- Pushes
- Pull requests
- Issues
- Comments
- Stars
Top contributors
Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity
| Contributor | Contributions | Pushes | PRs | Comments |
|---|---|---|---|---|
| itssam0 | 1 | 1 | 0 | 0 |
Recent activity
Latest issues, pull requests and releases
No issue or PR events — this repo's activity is pushes only.
Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.