summaryrefslogtreecommitdiff
path: root/src/Language/Fiddle/Parser.hs
Commit message (Collapse)AuthorAge
* Implement new syntactic-sugar for skip_to(). Allows specifying the offset ↵Josh Rahm2024-12-03
| | | | directly on a register
* Add metadata information to the BitsSubStructure and compile it correctly.Josh Rahm2024-11-27
|
* Added syntax for skip_to and buffer.Josh Rahm2024-11-26
| | | | | | | buffer tells fiddle to create a buffer of a number of bytes. skip_to tells fiddle to skip to some new offset. It's essentially an unnamed buffer
* Enforce that registers are either 8, 16, 32, or 64 bits.Josh Rahm2024-10-27
| | | | | Fixed the issues where the output C code did not use correct register sizes.
* Finish implementing alpha-version of the C-backend.Josh Rahm2024-10-27
| | | | | | This produces valid C code in a header file and also provides an INTF macro which makes it much less obtuse to call the various functions to set and unset bitfields.
* Implement bitfield arrays.Josh Rahm2024-10-22
|
* Change the AST to use Names instead of Identifiers for ObjDecls and BitsDeclsJosh Rahm2024-10-19
| | | | | This is to make anonymous expansion better and cleaner. It gets rid of the hash-mark hack introduced earlier.
* Provide more data during qualification about how a path is qualified.Josh Rahm2024-10-19
| | | | | | Now it includes information about the package a symobl is in. The object its in and the register its in. This allows better code generation in the backend that's somewhat more organized.
* Add ContExpression syntax tree.Josh Rahm2024-10-17
| | | | This is for expressions which must be calculatable at compile time.
* Start implementing a bunch of the C backend.Josh Rahm2024-10-13
| | | | | Have basic implementations down for coarse registers. Working on getting bitfields supported.
* Change 'Expression' to use numbers with units.Josh Rahm2024-10-11
| | | | | This helps to catch bugs in the compiler, specifically ones related to mixing up bits and bytes.
* Further implement C backend.Josh Rahm2024-10-11
| | | | | There is a problem where I'm mixing up bits and bytes. I think I'll try to resolve that using more type-level constraints.
* Change register identifiers to Guarantee a value in qualification.Josh Rahm2024-10-11
| | | | This remove the burden of generating names from the backend.
* Replace all the qualification metadata with 'When (s .>= Qualified)'Josh Rahm2024-10-11
| | | | | This makes deriving much easier and cleans up the messy contexts in GenericTree and elsewhere at the cost of slightly more obtuse syntax.
* Prefer GADT's over typ families for some SyntaxTree elements.Josh Rahm2024-10-11
|
* Change Witness to be a GADT.Josh Rahm2024-10-10
| | | | | This makes is much simpler to represent. Surprised I missed this ability.
* Add offset information to some AST elements.wipJosh Rahm2024-10-07
|
* Implement qualification.Josh Rahm2024-10-05
| | | | | | | Big change. Implements qualification, which separates the qualification concerns from the ConsistencyCheck phase. I'm getting close to implementing a backend.
* Clean up warnings and remove unused files.Josh Rahm2024-10-03
|
* Make changes to AST for qualification step.Josh Rahm2024-10-03
|
* Another monolithic change. Not good git ettiquite.Josh Rahm2024-10-03
| | | | | Import statements are fully implemented including compiling to an interface file for faster compilations.
* Add import resolution phase and also add a more abstractions aroundJosh Rahm2024-09-27
| | | | compliation phases.
* Rename some of the stages.Josh Rahm2024-09-26
| | | | | | Stage1 -> Parsed Stage2 -> Expanded Stage3 -> Checked
* feat: Add AdvanceStage typeclass and refactor code to use itJosh Rahm2024-09-25
| | | | | | | Introduced the `AdvanceStage` typeclass, which provides a mechanism to transition AST elements between different compilation stages. This abstraction facilitates easier traversal and modification of the syntax tree as it progresses through various compilation phases.
* Split the Ast file into multiple sub files.Josh Rahm2024-09-25
| | | | Make some more changes to the generic implementation of EasySwitchStage.
* Add import statements, add using statements, properly cross-packageJosh Rahm2024-09-22
| | | | symbols.
* More major changes to the grammer.Josh Rahm2024-09-22
| | | | | | Added annotation sublanguage for defining compiler directives. Also added the syntax for import statements. Imports are not implemented, but I'm currently working on that.
* Some major changes to the structure of the language.Josh Rahm2024-09-20
| | | | | | | | | Added structures and unions to better define the layout and model overlapping concerns. renamed objtype -> type and object -> instance. added reserved statements for types.
* Add Stage3 compliation.Josh Rahm2024-08-24
| | | | | I think this is the last phase before sending the refined AST to the backend compiler to be processed.
* Fleshed out stage2 and made some big changes.Josh Rahm2024-08-21
| | | | | Delegated behavior of Compile monad to monad transformers MaybeT and RWS.
* Crude compilation pipeline starting to take shape.Josh Rahm2023-01-09
| | | | | This simply does a Stage0 -> Stage1 conversion. Namely, parse the text, check for syntax errors, squeeze the resulting ast and ... that's it.
* Parser is able to parse the goal file.Josh Rahm2023-01-08
|
* Some more fleshing-out of the parser and better AST utils.Josh Rahm2022-12-18
|
* WIP: Basic parser implemented.Josh Rahm2022-12-17
| | | | | The parser is completely untested and probably broken, but it's probably pretty close becasue it does typecheck. This is a Work-in-progress.
* Start implementing "fiddle" code.Josh Rahm2022-12-16
nothing is happening right now, but it's on its way.
generated by cgit (git 2.34.1) at 2026-10-19 08:53:07 +0000